Palette predictor initializer when encoding or decoding self-contained coding structures

ABSTRACT

The invention concerns a method and a device for processing images, e.g. for encoding or decoding the images into or from a bitstream, using a palette prediction mode as defined in HEVC SCC. The images are split into hierarchical coding structures. At the decoder, the method comprises: decoding encoded data of two self-contained coding structures having the same hierarchical level, using a palette coding mode which uses, for each processed block of the two coding structures, an associated palette that comprises entries associating respective entry indexes with corresponding pixel values, wherein the palette associated with each processed pixel block is predicted from a palette predictor using prediction information from the bitstream; obtaining, from the bitstream, a palette predictor initializer associated with a coding structure hierarchically above the two self-contained coding structures; and initializing the palette predictor for each self-contained coding structure using the same obtained palette predictor initializer.

FIELD OF THE INVENTION

The present invention concerns a method and a device for processing atleast one image, e.g. for encoding or decoding the images into or from abitstream, using a palette prediction mode. It particularly concerns thepalette mode encoding as introduced in HEVC Screen Content Coding (SCC)Extension.

BACKGROUND OF THE INVENTION

It applies more particularly to a mode of coding where blocks of pixelsare each encoded based on a respective block of indexes encoded with orbuilt from a so-called palette.

A palette in this document is defined as a look up table having entries,or “elements”, associating an index with a value of a pixel. Generallyeach entry comprises one or three elements as mentioned later. Eachelement concerns the pixel value for a color component. For example, ifthe image is monochrome each entry of the palette comprises one elementfor the unique color component.

In other words, typically, but not necessarily, the value of a pixel isconstituted by the value of each colour component associated with thepixel, resulting in a colour palette. However, the value of a pixel maybe made of a single pixel component (named “element”), resulting in amonochrome palette.

This mode of encoding a block of pixel is generally referred to asPalette coding mode. It is contemplated to adopt this mode, for example,in the Screen Content Coding (SCC) Extension of the High EfficiencyVideo Coding international standard (see document JCTVC-S1005).

When encoding an image in a video sequence, the image is first dividedinto coding entities (also known as “coding structures”) of pixels ofequal size referred to as Coding Tree Blocks (CTBs). The CTBs may begrouped into other coding structures having a higher hierarchical level,such as slices and/or tiles. In other words, the image is recursivelydivided into hierarchical coding structures or coding entities.

The size of a Coding Tree Block is typically 64 by 64 pixels. EachCoding Tree Block may then be broken down into a hierarchical tree ofsmaller blocks whose size may vary and which are the actual blocks ofpixels to encode. These smaller blocks to encode are referred to asCoding Units (CUs).

The encoding of a particular Coding Unit involves competition betweenpredictive coding modes, including the well-known INTRA coding mode, thewell-known INTER coding mode, and the Palette coding mode.

With the Palette coding mode, it is possible to define a representativeblock for a given Coding Unit as a block of indexes from a palette: foreach pixel location in the Coding Unit, the said representative blockcontains the index associated with a pixel value in the Palette which isthe closest to the value of the pixel having the same location (i.e.collocated) in the coding unit. However, this palette-based algorithm ofselecting the closest palette entry is encoder-only in HEVC SCC: thereis no need to know said algorithm in order to parse or decode abitstream. Typically, closest means with the lowest distance using aparticular metric distance such as the sum of absolute, or the squareof, differences of component values. In particular, in case of losslesscoding, this means the palette entry should be selected as equal to thepixel by the encoder. In the following, “correspond to” or “match” isused to mean either “is equal” when in lossless coding, or “is theclosest” otherwise.

In the recent version of HEVC SCC, no residual between the originalpixel block and the corresponding palette-based representative pixelblock is provided. To avoid high quality decreasing in the encodedimage, an “escape-coded” feature has been introduced to encode thepixels, the values of which do not match a pixel value of an entry ofthe Palette. This means, in lossless coding, that no palette entry isequal to the pixel value. In such case, a specific index in the Paletteis used to signal an “escape-coded” pixel; and the quantized valueitself of the escape-coded pixel is directly encoded in the bitstream,the quantization depending on a quantizer step transmitted at theCU-level. In case of lossless coding, the quantizer step is 0, meaningno quantization. The quantization is what is defined in the HEVCstandard as the transform-bypass quantization, and the quantized valuesare encoded using truncated binary codes.

The Palette coding mode thus uses a current palette to build a block ofindexes representative of a current coding unit or block of pixels.Entry indexes in the Palette are also known as “levels”.

When using the Palette mode, the palette and the block of indexes or“levels” is often transmitted in the bitstream encoding the image. Thisrepresents a high cost of signalling because a palette, which maycomprise tens of entries, needs to be transmitted for each Coding Unit.

In Applicant's contribution in JCT-VC (No. JCTVC-Q0063 entitled “AhG10:palette predictor stuffing”, 17th Meeting: Valencia, ES, 27 Mar.-4 Apr.2014), it has been proposed to predict the current Palette for a currentCoding Unit using a palette predictor, for instance the last Paletteused (for the last processed Coding Unit). This approach aims atreducing the coding costs, since a palette is no longer fully explicitlytransmitted for each Coding Unit.

In addition, another proposed prediction mechanism relies on reusing thefull previous palette as it is, such reuse being indicated by a flagpalette_share_flag and requiring that the decoder stores the size ofsaid palette. However, storing that palette is un-needed as it is at thestart of the predictor.

However, some coding specificities may break the palette predictionscheme throughout the Coding Units of the image. This is the case ofcoding structures like Slices and Tiles.

The Slice and Tile coding structures have been introduced in HEVC toprovide re-synchronization in case of data loss in the sequence ofimages (video). Note that an independent tile as defined in the HEVCstandard comprises at least one slice and is spatially independent fromthe other tiles.

To obtain the re-synchronization property, the slices and tiles areencoded/decoded independently of each other. In other words, they are“self-contained”, meaning for instance that no INTRA prediction isperformed at the boundaries of the slice or tile, and no entropy codingstate or palette predictor or area for IBC (Intra Block Copy) predictionis shared with (or inherited from) a previously processed slice or tile.

The re-synchronization property thus makes data useful to prediction nolonger unavailable, therefore reducing coding efficiency. In Applicant'scontribution JCTVC-Q0063, the palette predictor is reset to zero whenstarting coding a new independent slice or tile, or even when startingcoding a new line of CTBs (known as Wavefront coding) or a new image orframe. Another approach in Applicant's contribution JCTVC-Q0063 consistsin resetting a set of palettes from which the palette predictor isselected, to a by-default palette which is locally (at the decoder)determined. For instance, the by-default palette is made of pixel valuesequally distributed over a colour space.

This approach is clearly not satisfactory, in particular with SCC wherethere is a high level of information redundancy within one and the sameimage.

Further, some coding specificities may break the palette predictionscheme throughout the Coding Units of the image. This is the case ofcoding structures like Slices and Tiles. As a consequence, in thecontribution JCTVC-T1005 entitled “HEVC Screen Content Coding Draft Text3”, 21^(st) Meeting: Geneva, CH, 19-26 Feb. 2015, it has been proposedto transmit a palette predictor initializer in the Picture Parameter Setextension for the HEVC SCC Extension. According to a particularembodiment, when the entries of that initializer are monochrome, themonochrome context and/or the bitdepths of the entries components aresignalled.

However signalling the colour format introduces either redundancies orpotentially some incompatibilities in parameter values.

SUMMARY OF THE INVENTION

The present invention has been devised to overcome all or part of theforegoing drawbacks. In particular, it seeks to improve encodingefficiency using the Palette mode, for instance to substantiallydecrease the signalling costs when using coding structures such as theslices or tiles.

In a first aspect, the present invention provides a method of decodingat least one image from a bitstream, the image being split intohierarchical coding structures including a plurality of slices, saidslices each having a same hierarchical level in the image, the methodcomprising the following steps:

decoding encoded data of two slices, using a palette coding mode, thepalette coding mode using, for each of processed pixel blocks of the twoslices, an associated palette that comprises a set of entriesassociating respective entry indexes with corresponding pixel values,wherein the palette associated with each processed pixel block ispredicted from a palette predictor using prediction information from thebitstream;

obtaining, from the bitstream, a palette predictor initializerassociated with a coding structure hierarchically above the slices; and

initializing the palette predictor for each of the two slices using theobtained palette predictor initializer,

wherein each palette predictor subsequent to the initialized palettepredictor includes all the entries of a current palette associated witha block currently being decoded and one or more entries of the palettepredictor used for predicting the current palette which are not used topredict the current palette.

In a second aspect the present invention provides a method of encodingat least one image into a bitstream, comprising the following steps:

obtaining hierarchical coding structures by splitting the image;

encoding data of two coding structures of the image independently ofeach other to obtain two encoded slices having a same hierarchical levelin the image, wherein said encoding uses a palette coding mode, thepalette coding mode using, for each of block of pixels of the twoslices, an associated palette that comprises a set of entriesassociating respective entry indexes with corresponding pixel values,wherein the encoding step includes determining prediction informationpredicting the palette associated with each processed pixel block from apalette predictor;

determining a palette predictor initializer to initialize the palettepredictor for the two slices; and

in the bitstream, providing the encoded data including the predictioninformation and providing the palette predictor initializer, wherein thepalette predictor initializer is associated with a coding structurehierarchically above the two slices in the bitstream, and

wherein, in the palette coding mode, each palette predictor subsequentto the initialized palette predictor includes all the entries of acurrent palette associated with a block currently being encoded andentries of the palette predictor for predicting the current palettewhich are not used to predict the current palette.

In an embodiment, the palette predictor initializer is defined at theimage level in a Picture Parameter Set, PPS; and the two slices makereference to the Picture Parameter Set.

In an embodiment, the palette predictor initializer is defined at asequence level in a Sequence Parameter Set, SPS; and the twoself-contained coding structures make reference to the SequenceParameter Set.

In an embodiment, the palette predictor initializer is defined after afirst field indicating whether the palette coding mode is activated ornot and after a second field comprising a maximum size for the palettepredictor, in the Sequence Parameter Set.

In an embodiment, the palette predictor initializer is defined at a tilelevel in a tile comprising the two slices; and each of the two slicesidentify the tile to which it belongs.

In an embodiment, the initializing step for both of the two slices isperformed before decoding the very first block of pixels in therespective slice.

In an embodiment, the prediction information to predict the palette fromthe palette predictor includes a bitmap of flags, each flag of whichdefining whether or not a corresponding entry in the palette predictoris selected as an entry to generate an entry in the palette.

In an embodiment of the second aspect, determining the predictorinitializer comprises encoding, using the palette coding mode, a subsetof blocks of pixels spread over an image area defined by said codingstructure hierarchically above the two slices, and comprises using apalette predictor obtained at the end of the encoding step, as thepalette predictor initializer.

The blocks of pixels of the subset may be distributed along a slope or adiagonal of the area.

The blocks of pixels of the subset may be horizontally aligned on thetop of the image.

The blocks of pixels of the subset may be not contiguous.

In an embodiment, determining a palette predictor initializer comprisesrecursively encoding the same subset of block of pixels, wherein thefirst palette predictor used for the next recursive encoding loop is thepalette predictor obtained at the end of the previous recursive encodingloop.

In an embodiment, the slices are included in two separate images.

In an embodiment, the slices are included in the same image.

In an embodiment, a size of the palette is set using a size of thepalette predictor initializer used to initialize the palette predictor.

In an embodiment the method further comprises obtaining informationabout the number of color components, the structure of the palettepredictor initializer being based on said information about the numberof color components. For example, the information may be a flag forsignalling whether said image is a monochrome image or not.

In a third aspect of the present invention there is provided a decodingdevice for decoding at least one image from a bitstream, the image beingsplit into hierarchical coding structures including a plurality ofslices, said slices each having a same hierarchical level in the image;

decoding means for decoding encoded data of two slices, using a palettecoding mode, the palette coding mode using, for each of processed pixelblocks of the two slices, an associated palette that comprises a set ofentries associating respective entry indexes with corresponding pixelvalues, wherein the palette associated with each processed pixel blockis predicted from a palette predictor using prediction information fromthe bitstream;

obtaining means for obtaining, from the bitstream, a palette predictorinitializer associated with a coding structure hierarchically above thetwo slices; and

initializing means for initializing the palette predictor for each ofthe two slices using the obtained palette predictor initializer,

wherein, in the palette coding mode, each palette predictor subsequentto the initialized palette predictor includes all the entries of acurrent palette associated with a block currently being decoded and oneor more entries of the palette predictor for predicting the currentpalette which are not used to predict the current palette.

In a fourth aspect of the present invention there is provide a devicefor encoding at least one image into a bitstream, the encoding devicecomprising:

obtaining means for obtaining hierarchical coding structures bysplitting the image;

encoding data of two coding structures of the image independently ofeach other to obtain two slices having a same hierarchical level in theimage, wherein said encoding uses a palette coding mode, the palettecoding mode using, for each block of pixels of the two slices, anassociated palette that comprises a set of entries associatingrespective entry indexes with corresponding pixel values, wherein theencoding step includes determining prediction information predicting thepalette associated with each processed pixel block from a palettepredictor;

determining a palette predictor initializer to initialize the palettepredictor for the two slices; and

in the bitstream, providing the encoded data including the predictioninformation and providing the palette predictor initializer, wherein thepalette predictor initializer is associated with a coding structurehierarchically above the two slices in the bitstream, and

wherein, in the palette coding mode, each palette predictor subsequentto the initialized palette predictor includes all the entries of acurrent palette associated with a block currently being encoded andentries of the palette predictor for predicting the current palettewhich are not used to predict the current palette.

In a fifth aspect of the present invention there is provided a computerprogram which, when executed causes the method of any of the precedingstatements to be performed.

The present invention, in a further aspect provides a method of decodingat least one image from a bitstream, the image being split intohierarchical coding structures, the method comprising the followingsteps:

decoding encoded data of two self-contained coding structures (i.e.coding structures encoded independently of other coding structures ofthe same hierarchical level) having the same hierarchical level in theimage, using a palette coding mode, the palette coding mode using, foreach of processed pixel blocks of the two coding structures, anassociated palette that comprises a set of entries associatingrespective entry indexes with corresponding pixel values, wherein thepalette associated with each processed pixel block is predicted from apalette predictor using prediction information from the bitstream;

obtaining, from the bitstream, a palette predictor initializerassociated with a coding structure hierarchically above the twoself-contained coding structures; and

initializing the palette predictor for each of the two self-containedcoding structures using the same obtained palette predictor initializer.

In a symmetric fashion, the present invention also provides a method ofencoding at least one image into a bitstream, comprising the followingsteps:

obtaining hierarchical coding structures splitting the image;

encoding data of two coding structures of the image independently ofeach other coding structure having the same hierarchical level in theimage to obtain two self-contained encoded coding structures, saidencoding using a palette coding mode, the palette coding mode using, foreach of processed pixel blocks of the two coding structures, anassociated palette that comprises a set of entries associatingrespective entry indexes with corresponding pixel values, wherein theencoding step includes determining prediction information predicting thepalette associated with each processed pixel block from a palettepredictor;

determining a single palette predictor initializer to initialize thepalette predictor for the two self-contained coding structures; and

in the bitstream, providing the encoded data including the predictioninformation and providing the palette predictor initializer, wherein thepalette predictor initializer is associated with a coding structurehierarchically above the two self-contained coding structures in thebitstream.

Correlatively, the invention provides a decoding device for decoding atleast one image from a bitstream, the image being split intohierarchical coding structures, the decoding device comprising at leastone microprocessor configured for carrying out the steps of the abovedecoding method. The invention also provides an encoding device forencoding at least one image into a bitstream, the encoding devicecomprising at least one microprocessor configured for carrying out thesteps of the above encoding method.

Thanks to the invention, coding efficiency is improved. This is mainlyachieved by using a palette predictor initializer defined at ahierarchical level strictly higher than the one of the coding structuresthat need initializing their palette predictor. This is because the samepalette predictor initializer can be used by several independent codingstructures (e.g. slices), at low costs (i.e. without being sent severaltimes in the bitstream).

Optional features of embodiments of the invention are defined in theappended claims. Some of these features are explained here below withreference to a method, while they can be transposed into system featuresdedicated to a device according to embodiments of the invention.

In embodiments, the palette predictor initializer is defined at theimage level in a Picture Parameter Set, PPS; and the two self-containedcoding structures refer to the Picture Parameter Set. This provision isfully compatible with some optimizations at the encoder's end, such asupdating the palette predictor initializer after a certain amount offrames or time, or using a palette predictor initializer per sub-area ofan image (e.g. tile or arbitrary sub-area).

In a variant, the palette predictor initializer is defined at a sequencelevel in a Sequence Parameter Set, SPS; and the two self-containedcoding structures refer to the Sequence Parameter Set. As for the PPSapproach above, this variant does not require additional data at theself-contained coding structure (e.g. slice) level. This is because areference to an SPS (or PPS) already exists in the signalling of theself-contained coding structures (e.g. slices). Coding efficiency isthus highly improved.

According to a specific feature, the palette predictor initializer isdefined after a first field indicating whether the palette coding modeis activated or not and after a second field comprising a maximum sizefor the palette predictor, in the Sequence Parameter Set. This provisionoptimizes processing costs, since for instance no palette predictorinitializer determination has to be performed if the first fieldindicates that the palette coding mode is not activated.

In another variant, wherein the two self-contained coding structures areslices; and the palette predictor initializer is defined at a tile levelin the tile comprising the two self-contained coding structures; andeach of the two self-contained coding structures identify the tile towhich it belongs. Compared to the definition of the initializer in thePPS, this provision makes it possible to limit the increase of the PPSID. This is because there is no longer the need to provide a new PPS IDfor each new palette predictor initializer declared. To be noted that alist of initializers may be defined within a PPS, wherein eachinitializer is associated with a specific tile.

Regarding the decoding, embodiments may provide that the initializingstep for any of the two self-contained coding structures is performedbefore decoding the very first block of pixels in the self-containedcoding structure considered. This is because, because of the“self-contained” property, the coding/decoding of the very first blockcannot inherit of data (including the palette predictor) from a previouspixel block or coding structure.

In some embodiments, a next palette predictor for a next block of pixelsin one of the two self-contained coding structures is built from acurrent palette used to encode a current block of pixels in the sameself-contained coding structure. In that case, it is advantageous toinitialize said palette predictor rather than to extend it, as, in thelatter case, the extended palette predictor may end up later havingduplicated values.

Note that the pixel blocks are usually successively considered accordingto a scanning order, for instance a raster scan, within the codingstructure considered. The next palette predictor is for instance used toevaluate the palette coding mode during the competition with the othercoding modes (INTRA, INTER, etc). In case the palette coding mode is notselected for the next pixel block, the “next palette predictor” can beused for the further next pixel block.

The above provision shows that the palette predictor is bound todynamically evolve as the pixel blocks within the coding structure (e.g.slice) are coded.

In a particular embodiment, the next palette predictor is built fromonly the current palette and a current palette predictor used to predictthe current palette.

In particular, the next palette predictor may be built by selecting allthe entries of the current palette and selecting the entries of thecurrent palette predictor that have not been used to predict the currentpalette. This approach incrementally supplements the palette predictorsused in the self-contained coding structure with new colors that may beadded to the current palettes while encoding the pixel blocks. As aresult, the palette coding mode becomes more and more efficient as thepixel blocks are traversed.

In embodiments, the prediction information to predict the palette fromthe palette predictor includes a bitmap of flags (usually decoded fromthe bitstream at the decoder's end, and added into the bitstream at theencoder's end), each flag of which defining whether or not acorresponding entry in the palette predictor is selected as an entry togenerate an entry in the palette.

In specific embodiments, the bitmap of flags (usually encoded usingRLE—run-length encoding) comprises the same number of bits as the numberof entries in the palette predictor, and each bit at a position in thebitmap defines whether or not the entry having the correspondingposition in the palette predictor is selected as an entry of thepalette. This configuration improves the coding efficiency. A variantthat may further reduce the size of the bitmap may consider stopping thebitmap at the last entry that is selected as an entry of the palette.This is particularly advantageous since, as suggested above, the entriesin the palette predictor are ordered according to their occurrences. Insome embodiments, this results in the last entries of the palettepredictor being statistically not often used for the palette.

In other specific embodiments, the method may further comprise addingadditional entries at the end of the palette having the selected entriesfrom the palette predictor. These additional entries may be entries foradditional pixels decoded (at both the decoder and the encoder using adecoding loop) and/or entries from a predetermined palette that is forexample built by the encoder and transmitted (in the bitstream) to thedecoder (as in the conventional Palette coding mode). This provision isto increase the coding efficiency of the palette.

In a variant to transmit a bitmap of flags, an implicit approach may beused, thus reducing additional data or bits (the bitmap) to be sent inthe bitstream: it is possible to indicate through a flag(palette_share_flag) that the next pixel block or CU to be palette-codedwill reuse all the entries of the last palette used for the lastpalette-coded pixel block or CU. In that case, a specific embodiment mayconsist in initializing, using the palette predictor initializer size,the size of the palettes that are to be used for encoding the pixelblocks.

In some embodiments, the pixel values of the entries of the currentpalette have colour components, and only a subpart of the colourcomponents are predicted using the palette predictor. In practice, oneor two colour components out of three may be predicted. This provisionreduces processing and signalling in the bitstream.

Regarding the encoding, embodiments may provide that determining asingle palette predictor comprises encoding, using the palette codingmode, a subset of blocks of pixels spread over an image area made ofsaid coding structure hierarchically above the two self-contained codingstructures, and comprises using a palette predictor obtained at the endof the encoding step, as the palette predictor initializer.

Restricting the determining step to a subset of pixels makes it possibleto have low complexity process in determining an initializer. This isparticularly suitable for low delay encoding.

To be noted that the palette coding mode is preferably competing withother coding modes (e.g. INTRA and INTER) so that the blocks which arenot adapted for palette coding are withdrawn (because encoded usinganother coding mode) from consideration. Also, the encoding of thedetermining step does not result in generating data for the bitstream,but only constitutes an analysis of the subset of pixels based onpalette encoding.

In some embodiments, the pixel blocks of the subset are distributedalong a slope or a diagonal of the area. This is to have a subset ofpixel blocks that is representative as much as possible of the wholeimage area for which the palette predictor initializer will be used.

In a variant, the pixel blocks of the subset are horizontally aligned onthe top of the image area, preferably on the top of the image. Thepalette predictor initializer thus obtained is well suited for theencoding of the start of the image, and can be used for severalsuccessive images.

In a specific embodiment, the pixel blocks of the subset are notcontiguous. For instance, each two (or more) pixel blocks, one pixelblock may be selected. This is to avoid useless processing that mayresult from processing very similar contiguous pixel blocks.

In other embodiments, determining a single palette predictor comprisesrecursively encoding the same subset of block of pixels, wherein thefirst palette predictor used for the next recursive encoding loop is thepalette predictor obtained at the end of the previous recursive encodingloop. In other words, the palette predictor obtained at the end of theprevious recursive encoding loop is used as a palette predictorinitializer for the next encoding loop. As the number of recursive loopsincreases, the palette predictor initializer becomes more and morerelevant for encoding the pixel blocks of the self-contained codingunit. As a consequence, more pixel blocks are palette encoded and lesspixel blocks are INTER or INTRA coded, thus improving the encoding rate.

In some embodiments, the two self-contained coding structures areincluded in two separate images. In a variant, the two self-containedcoding structures are included in the same image.

In some embodiments that may relate to the reuse or sharing of a palettebetween successive palette-coded pixel blocks, the method may furthercomprise defining the size of the current palette. For instance, a sizeof the palette may be set using a size of the palette predictorinitializer used to initialize the palette predictor. This mainly occursfor the first palette-coded in the self-contained coding structure,since no palette is inherit from previous pixel blocks. In someembodiments that may relate to the sharing of a palette betweensuccessive palette-coded pixel blocks, the method may further compriseinitializing the size of said shared palette, when no previous paletteactually exists. According to an embodiment of the invention, this sizemay be initialized using the size of the palette predictor initializerif this one is inferior to a maximum size allowed for the palettes.

In an embodiment information about the number of color components isobtained, the palette predictor initializer structure being based onsaid information.

In other words, the palette predictor initializer may comprise as manycomponents as color components, the number of palette predictorinitializer components being obtained from said information.

Preferably said information is a flag for signalling whether said imageis a monochrome image or not.

Another aspect of the invention relates to a non-transitorycomputer-readable medium storing a program which, when executed by amicroprocessor or computer system in a device for decoding or encodingat least one image, causes the device to perform the decoding orencoding method as defined above.

The non-transitory computer-readable medium may have features andadvantages that are analogous to those set out above and below inrelation to the methods and devices.

Another aspect of the invention relates to a method of decoding at leastone images from a bitstream, the image being split into hierarchicalcoding structures, substantially as herein described with reference to,and as shown in, FIG. 12a , or FIG. 12b , or FIGS. 12 and (14 a or 14 bor 14 c or 14 d) of the accompanying drawings.

Yet another aspect of the invention relates to a method of encoding atleast one image into a bitstream, substantially as herein described withreference to, and as shown in, FIG. 13b , or FIGS. 13a and 13b , orFIGS. 13a and (14 a or 14 b or 14 c or 14 d) of the accompanyingdrawings.

Another aspect of the invention relates to a method of decoding apicture parameter set used for decoding images from a bitstream, theimage comprising pixels having at least one color-component, the methodbeing broken down into several steps. The method comprises:

decoding one color-component parameter defined in the picture parameterset and involved in at least two steps of the decoding method,indicating if said image is monochrome, and;

skipping or amending at least one step of the decoding method if thedecoded color-component parameter indicates that the image ismonochrome.

This aspect of the invention aims at proposing a syntax without anyredundancy which used to be source of faults. This aspect of theinvention is more efficient and prevents contradictory configurations.

In an embodiment at least two different steps are either skipped oramended, at least one of the steps comprising decoding pixel valueshaving been encoded using a palette mode.

In an embodiment, one step comprises determining the number of elementsfor at least one entry or each entry of a palette predictor initializer.As defined above each element concerns the pixel value for a colorcomponent. For example, if the image is monochrome each entry of thepalette comprises one element for the unique color component

In an embodiment, each entry of a palette predictor initializer is asingleton if the decoded color-component parameter is set to apredetermined value, else a triplet.

In an embodiment, one of the steps is related to the residual adaptivecolour transform, which is skipped if the color-component parameterindicates that the image is monochrome.

In an embodiment, the parameter is a flag taking the value “1” when theimage is monochrome.

Another aspect of the invention relates to a method of decoding apicture parameter set used for decoding images from a bitstream, theimage comprising pixels having at least one color-component, said imagebeing encoded by using one mode among a plurality of modes including thepalette mode. The method comprises:

-   -   A step related to the residual adaptive colour transform; and    -   A step for defining a palette predictor initializer, the        defining step being processed based on the value of a        color-component parameter indicating if the image is monochrome        or not.

The value of the color-component parameter is inferred from theexecution of the residual adaptive colour transform.

This other aspect of the invention aims at proposing a syntax withoutany redundancy which used to be source of faults. This aspect of theinvention is more efficient and prevents contradictory configurations.

In an embodiment, if the residual adaptive colour transform is executed,the value of the color-component parameter is inferred to indicate thatthe image is not monochrome.

In an embodiment, the color-component parameter is a flag whose value isinferred to be “0” if the residual adaptive colour transform isexecuted.

Another aspect of the invention relates to a method of decoding apicture parameter set used for decoding images from a bitstream, theimage comprising pixels having at least one color-component, at leastone image being encoded by using the palette mode, the method comprisinga step for initializing a palette predictor with a palette predictorinitializer having the same number of entries, the palette predictorinitializer and the palette predictor having one or more elements perentry.

The initialization of the palette predictor by the palette predictorinitializer is governed by predetermined rules when switching from animage having pixels with a given number of color-components to an imagehaving another number color-components.

In an embodiment, a predetermined rule comprises for at least one entryof the palette predictor, setting at least two of the elements to thesame element's value of the palette predictor initializer.

In an embodiment, a predetermined rule comprises for at least one entryof the palette predictor, setting at least one of the elements to apredetermined default value.

In an embodiment, the predetermined rule is applied when switching froman image having one color-component to an image having threecolor-components.

According to another aspect of the invention it is proposed a decodingdevice for decoding a picture parameter set related to an image from abitstream, said device being configured to implement a decoding methodaccording to one of the embodiments described above.

According to another aspect of the invention it is proposed anon-transitory computer-readable medium storing a program which, whenexecuted by a microprocessor or computer system in a device for decodingat least one image, causes the device to perform the method according toone of the embodiments described above. At least parts of the methodsaccording to the invention may be computer implemented. Accordingly, thepresent invention may take the form of an entirely hardware embodiment,an entirely software embodiment (including firmware, resident software,micro-code, etc.) or an embodiment combining software and hardwareaspects that may all generally be referred to herein as a “circuit”,“module” or “system”. Furthermore, the present invention may take theform of a computer program product embodied in any tangible medium ofexpression having computer usable program code embodied in the medium.

Since the present invention can be implemented in software, the presentinvention can be embodied as computer readable code for provision to aprogrammable apparatus on any suitable carrier medium. A tangiblecarrier medium may comprise a storage medium such as a floppy disk, aCD-ROM, a hard disk drive, a magnetic tape device or a solid statememory device and the like. A transient carrier medium may include asignal such as an electrical signal, an electronic signal, an opticalsignal, an acoustic signal, a magnetic signal or an electromagneticsignal, e.g. a microwave or RF signal. In other words, the carriermedium may be transitory or non-transitory.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention will now be described, by way of exampleonly, and with reference to the following drawings in which:

FIG. 1 illustrates the HEVC encoder architecture;

FIG. 2 illustrates the HEVC decoder architecture;

FIG. 3 illustrates the concept of the causal area;

FIG. 4 illustrates the Coding Tree Block splitting into Coding Units andthe scan order decoding of these Coding Unit;

FIG. 5 illustrates the principle of Palette mode at the decoder sideunder investigation in the SECC Extension of HEVC, together withprediction of said palette;

FIG. 6 illustrates an example of a coding unit with its correspondingblock of levels and the associated palette;

FIG. 7 illustrates the same block of levels and the set of syntaxelements used for the encoding of this block of levels;

FIG. 8 illustrates the decoding process of the syntax elements relatingto the Palette coding mode;

FIG. 9 illustrates the reconstruction process to build the block oflevels at the decoding side;

FIG. 10 illustrates a prediction scheme including an exemplary iterativebuilding of a palette predictor;

FIG. 11 illustrates various block structures used in video coding;

FIG. 12a illustrates the parsing of a palette predictor initializer froma bitstream;

FIG. 12b illustrates the use of a palette predictor initializer by thedecoder for decoding a bitstream;

FIG. 13a illustrates various subsets of blocks for use in an encoderdetermination of the palette predictor initializer;

FIG. 13b illustrates an analysis performed by the encoder on a subset ofblocks for determining the palette predictor initializer;

FIG. 14 a, b, c and d illustrate examples of signalling the paletteprediction initializer in existing SPS or PPS SCC extensions, as writtenby the encoder and parsed by the decoder;

FIG. 15 illustrates an example of signalling the palette predictioninitializer, as proposed in the JCTVC-T1005 document, in the PPS SCCextension, as written by the encoder and parsed by the decoder;

FIG. 16 illustrates an embodiment of a further aspect of the invention;

FIG. 17 illustrates another embodiment of the further aspect invention;

and

FIG. 18 is a schematic block diagram of a computing device forimplementation of one or more embodiments of the invention.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

FIG. 1 illustrates the HEVC encoder architecture. In the video encoder,an original sequence 101 is divided into blocks of pixels 102. A codingmode is then assigned to each block. There are two families of codingmodes typically used in HEVC: the modes based on spatial prediction orINTRA modes 103 and the modes based on temporal prediction or INTERmodes based on motion estimation 104 and motion compensation 105. Anextension of HEVC being currently designed, known as HEVC SCC, addsadditional coding modes, in particular the Palette coding mode, whichcompetes with INTRA and INTER coding modes to encode blocks of pixels.This Palette coding mode is described in more details below, inparticular with reference to FIGS. 5 to 9. One skilled in the art mayalso obtain details about the Palette coding mode in documentJCTVC-S1005 (HEVC Screen Content Coding Draft Text 2), the latest as ofwriting. To be noted that the invention is not limited to theimplementation of the Palette coding mode as described in the HEVC SCCextension, but may apply to any palette predictive scheme.

An INTRA Coding Unit is generally predicted from the encoded pixels atits causal border by a process called INTRA prediction.

Temporal prediction of an INTER coding mode first consists in finding ina previous or future frame called the reference frame 116 the referencearea of which is the closest to the Coding Unit, in a motion estimationstep 104. This reference area constitutes the predictor block. Next thisCoding Unit is predicted using the predictor block to compute theresidue in a motion compensation step 105.

In both cases, spatial and temporal prediction, a residual is computedby subtracting the Coding Unit from the original predictor block.

In the INTRA prediction, a prediction direction is encoded. In thetemporal prediction, at least one motion vector is encoded. However, inorder to further reduce the bitrate cost related to motion vectorencoding, a motion vector is not directly encoded. Indeed, assuming thatmotion is homogeneous, it is particularly advantageous to encode amotion vector as a difference between this motion vector, and a motionvector in its surroundings. In the H.264/AVC coding standard forinstance, motion vectors are encoded with respect to a median vectorcomputed between 3 blocks located above and on the left of the currentblock. Only a difference, also called residual motion vector, computedbetween the median vector and the current block motion vector is encodedin the bitstream. This is processed in module “Mv prediction and coding”117. The value of each encoded vector is stored in the motion vectorfield 118. The neighbouring motion vectors, used for the prediction, areextracted from the motion vector field 118.

Next, the mode optimizing the rate distortion performance is selected inmodule 106. In order to further reduce the redundancies, a transform,typically a DCT, is applied to the residual block in module 107, and aquantization is applied to the coefficients in module 108. The quantizedblock of coefficients is then entropy coded in module 109 and the resultis inserted into the bitstream 110.

The encoder then performs a decoding of the encoded frame for the futuremotion estimation in modules 111 to 116. This is a decoding loop at theencoder. These steps allow the encoder and the decoder to have the samereference frames. To reconstruct the coded frame, the residual isinverse quantized in module 111 and inverse transformed in module 112 inorder to provide the “reconstructed” residual in the pixel domain.According to the encoding mode (INTER or INTRA), this residual is addedto the INTER predictor 114 or to the INTRA predictor 113.

Next, this first reconstruction is filtered in module 115 by one orseveral kinds of post filtering. These post filters are integrated intothe decoding loop. This means that they need to be applied to thereconstructed frame at the encoder and decoder in order to use the samereference frames at the encoder and decoder. The aim of this postfiltering is to remove compression artefacts.

The principle of an HEVC decoder has been represented in FIG. 2. Thevideo stream 201 is first entropy decoded in a module 202. The residualdata are then inverse quantized in a module 203 and inverse transformedin a module 204 to obtain pixel values. The mode data are also entropydecoded and depending on the mode, an INTRA type decoding or an INTERtype decoding is performed. In the case of INTRA mode, the INTRAprediction direction is decoded from the bitstream. The predictiondirection is then used to locate the reference area 205. If the mode isINTER, the motion information is decoded from the bitstream 202. This iscomposed of the reference frame index and the motion vector residual.The motion vector predictor is added to the motion vector residual toobtain the motion vector 210. The motion vector is then used to locatethe reference area in the reference frame 206. Note that the motionvector field data 211 is updated with the decoded motion vector in orderto be used for the prediction of the next decoded motion vectors. Thisfirst reconstruction of the decoded frame is then post filtered 207 withexactly the same post filter as used at the encoder side. The output ofthe decoder is the de-compressed video 209.

FIG. 3 illustrates the causal principle resulting from block-by-blockencoding as in HEVC.

At a high-level, an image is divided into Coding Units that are encodedin raster scan order. Thus, when coding block 3.1, all the blocks ofarea 3.3 have already been encoded, and can be considered available tothe encoder. Similarly, when decoding block 3.1 at the decoder, all theblocks of area 3.3 have already been decoded and thus reconstructed, andcan be considered as available at the decoder. Area 3.3 is called thecausal area of the Coding Unit 3.1. Once Coding Unit 3.1 is encoded, itwill belong to the causal area for the next Coding Unit. This nextCoding Unit, as well as all the next ones, belongs to area 3.4illustrated as a dotted area, and cannot be used for coding the currentCoding Unit 3.1. It is worth noting that the causal area is constitutedby reconstructed blocks. The information used to encode a given CodingUnit is not the original blocks of the image for the reason that thisinformation is not available at decoding. The only information availableat decoding is the reconstructed version of the blocks of pixels in thecausal area, namely the decoded version of these blocks. For thisreason, at encoding, previously encoded blocks of the causal area aredecoded to provide this reconstructed version of these blocks.

It is possible to use information from a block 3.2 in the causal areawhen encoding a block 3.1. In the HEVC Extension draft specifications, adisplacement vector 3.5, which can be transmitted in the bitstream, mayindicate this block 3.2.

FIG. 4 illustrates a splitting of a Coding Tree Block into Coding Unitsand an exemplary scan order to sequentially process these Coding Units.In the HEVC standard, the block structure is organized by Coding TreeBlocks (CTBs). A frame contains several non-overlapped and square CodingTree Blocks. The size of a Coding Tree Block can range in size from64×64 to 16×16. This size is determined at sequence level. The mostefficient size, in term of coding efficiency, is the largest one: 64×64.Note that all Coding Tree Blocks have the same size except for the imageborder, meaning that they are arranged in rows. The size of the borderCTBs is adapted according to the amount of remaining pixels.

Each Coding Tree Block contains one or more square Coding Units (CU).The Coding Tree Block is split based on a quad-tree structure intoseveral Coding Units. The processing (coding or decoding) order of eachCoding Unit in the Coding Tree Block follows the quad-tree structurebased on a raster scan order. FIG. 5 shows an example of the processingorder of Coding Units. In this figure, the number in each Coding Unitgives the processing order of each corresponding Coding Unit of thisCoding Tree Block.

In HEVC, several methods are used to code the different syntax elements,for example block residuals, information on predictor blocks (motionvectors, INTRA prediction directions, etc.). HEVC uses several types ofentropy coding such as the Context based Adaptive Binary ArithmeticCoding (CABAC), Golomb-rice Code, or simple binary representation calledFixed Length Coding. Most of the time a binary encoding process isperformed to represent the different syntax elements. This binaryencoding process is also very specific and depends on the differentsyntax element.

The HEVC Screen Content Coding Extension, also commonly called HEVC SCC,is an extension that is currently being drafted for the new video codingstandard HEVC. It is derived from the HEVC Range Extension, alsocommonly called HEVC RExt.

An aim of this extension is to provide additional tools to encode videosequences in particular for the 4:4:4 colour format with 8 bits ofbit-depth, and possibly losslessly, containing contents such asgraphical user interfaces captures, computer-graphic generated content,etc. (known as Screen Contents).

A colour image is generally made of three colour components R, G and B.These components are generally correlated, and it is very common inimage and video compression to de-correlate the colour components priorto processing the images. The most common format that de-correlates thecolour components is the YUV colour format. YUV signals are typicallycreated from RGB representation of images, by applying a lineartransform to the three inputs R, G and B input frames. Y is usuallycalled Luma component, U and V are generally called Chroma components.The term ‘YCbCr’ is also commonly used in place of the term ‘YUV’.

Moreover some SCC's tools may be compatible with other colour formats.In particular, the palette mode has been made compatible with 4:2:0 byadjusting the 4:4:4 case which has been set to handle monochrome data byoperating on a single component instead of three components. Differentbit depths can also been handled.

HEVC SCC, beside lossy compression, is also able to provide a losslessencoding of the input sequences; this is to have a decoded output 209strictly identical to the input 101. To achieve this, a number of toolshave been modified or added, compared to the conventional HEVC RExtlossy codec.

Additional tools for HEVC SCC are currently being designed toefficiently encode “screen content” video sequences in addition tonatural sequences. As briefly introduced above, the “screen content”video sequences refer to particular video sequences which have a veryspecific content corresponding to those captured from a personalcomputer of any other device, containing for example text, PowerPointpresentation, Graphical User Interface, tables (e.g. screen shots).These particular video sequences have quite different statisticscompared to natural video sequences. In video coding, performance ofconventional video coding tools, including HEVC, proves sometimes to beunderwhelming when processing such “screen content”.

The tools currently discussed on in HEVC SCC to process “screen content”video sequences include the Adaptive Color Transform, the Intra BlockCopy mode and the Palette mode. Prototypes for these modes have showngood coding efficiency compared to the conventional method targetingnatural video sequences. The present application focuses on the Palettecoding mode.

The Palette coding mode of HEVC SCC is a coding mode, meaning that theinformation directly codes pixel data. As currently drafted, the Palettecoding mode does not use residual data, but uses an “escape coding” whena pixel does not match with any entry of the palette currently used. Inparticular, in case of lossless coding, this means the palette entryshould be selected as equal to the pixel by the encoder, or that theescape coded pixel is not quantized, the quantizer value beingtransmitted at the CU level.

A palette is generally represented by a table containing a finite set ofN-tuple of colours, each colour being defined by its components in agiven colour space (see for example 603 in FIG. 6 based on YUV colourspace). For example, in a typical RGB format, the palette is composed ofa list of P elements of N-tuple (where N=3 for a RGB). More precisely,each element corresponds to a fixed triplet of colour components in theRGB format. Of course this is not limited to a RGB or YUV colour format.Any other colour format can be represented by a palette and can use asmaller or a higher number of colour components, meaning that N may bedifferent from 3.

At the encoder side, the Palette mode, under consideration in HEVC SCC,consists in transforming pixel values of a given input coding unit intoindexes called levels. The levels identify the entries in an associatedpalette, the pixel values of which match the pixel values of the inputcoding unit. However, when a pixel value of the input coding unit cannotbe represented by a level (i.e. it does not match), e.g. because thedistortion would be too large (greater than 0 in case of losslesscoding), then said pixel is represented by a specific level, indicating“escape coding”. For each pixel being represented by this specific“escape coding” level, quantized pixel values are furthermoretransmitted.

After the transformation, the resulting coding unit is composed of ablock of levels and a block of quantized values (for the escape-codedpixels). It is then transmitted to the decoder with the associatedpalette, generally a table having a finite number of triplets of coloursused to represent the coding unit. Since the palette defines a finitenumber of colours, the transformation into a block of indexes usuallyapproximates the original input coding unit in lossy coding, butstrictly corresponds to the original input coding unit in losslesscoding.

To apply the Palette mode at the encoder side, an exemplary way totransform a coding unit of pixels is performed as follows:

-   -   find the P triplets best describing the coding unit of pixels to        encode, for example by minimizing overall distortion;    -   then associate with each pixel of the coding unit the matching        colour among the P triplets: the value to encode (or level)        (which thus forms part of the block of indexes) is then the        index corresponding to the entry of the associated matching        colour. The block of indexes is thus obtained from the palette        by comparing the entries of the palette to each pixel of the        coding unit, in order to identify, for each pixel, the entry        which defines the matching colour. If no entry matches, then the        level indicating escape coding, as well as quantized pixel        values, is associated with the pixel (in the block of quantized        values).

For each coding unit, the palette (i.e. the P triplets found), the blockof indexes or levels and the block of quantized pixel values are codedin the bitstream 110 and sent to the decoder.

Furthermore, specific flags may be provided in some sets of parametersin the bitstream to specify whether or not the Palette coding mode isactivated (for instance in the Sequence Parameter Set, or “SPS”). Thosesets of parameters are also referred to as syntax structures.

Also, at the coding unit level, a flag may specify whether or not thecoding unit has escape-coded values, to force the palette to include theabove-mentioned specific “escape coding” level.

At the decoder, the Palette coding mode consists in performing theconversion in the reverse way. This means that each decoded indexassociated with each pixel of the coding unit is replaced by thecorresponding colour in the palette decoded from the bitstream, in orderto reconstruct the corresponding colour for each pixel of the codingunit. Note that if a pixel is associated with the “escape coding” level, then the corresponding quantized pixel value is decoded and inversequantized from the block of quantized pixel values (i.e. of escape-codedpixels). This is the reconstruction of the block of indexes in thecolour space (i.e. of the coding unit predictor).

FIG. 5 further illustrates the principle of the Palette coding mode atthe decoder. When decoding a slice, frame or tile, the decoding processloops over the CUs from the bitstream, starting from a first codingunit. Then, the prediction mode for the current coding unit is extractedat step 502 from the bitstream 501. Currently, the Palette mode isidentified by a flag located after the skip flag and the intra blockcopy flag in the bitstream (the other coding modes have been describedabove with reference to FIGS. 1 and 2). This flag is CABAC coded using asingle context. If this mode is not the Palette mode 503 thenconventional decoding occurs on step 520. Otherwise, the related syntaxof the Palette mode 505, i.e. the information on the palette, the blockof levels and the block of escape-coded pixels, is extracted and decoded504 from the bitstream 501.

Next, during step 506, the following elements are built from the decodeddata: the palette 509, the block of escape-coded pixels 507 and theblock of levels 508. In particular, HEVC SCC provides that the paletteis predicted from a palette predictor 510. From the block of levels, theassociated palette and the block of escape-coded pixels, thereconstructed coding unit in pixel domain 514 is built. This means thatfor each level of the block of levels, a colour (RGB or YUV) isassociated with each pixel.

Palette 509 is then used to update palette predictor 510 for use indecoding other palette-coded CUs.

To be noted that the prediction of palette 509 using palette predictor510 may not use all the entries of palette predictor 510. Information onthe used entries of palette predictor 510 or the non-used entries, aswell as information on the size of the last used palette may be stored.Such information is reused as described below.

FIG. 6 illustrates the principle of the Palette coding mode at theencoder. The current coding unit 601 is converted into a block 602 ofthe same size which contains a level for each pixel instead of threecolour values (Y, U, V) or (R, G, B). For means of illustration, pixel611 of 601 is actually escape-coded and therefore, its associated level612 indicates the escape coding level 613 (value “3”) of the palette. Asa consequence, block 604 of escape-coded pixels contains the quantizedpixel value of a single pixel 620. The palette 603 associated with blockof levels 602 is built based on coding unit overall distortionminimization and associates at each entry, an entry index or level withcorresponding pixel colour values. Note that for monochrome application,the pixel value can contain only one component.

As mentioned above in relation to FIG. 5, the palette (as well as theblock of escape-coded pixels) is coded and inserted into the bitstreamfor each coding unit. In the same way, the block of levels(corresponding to the coding unit) is coded and inserted into thebitstream and an example of the coding is given below with reference toFIG. 7. In this example, the block of levels is scanned in a horizontalorder.

The block of levels 71 is exactly the same as the one illustrated inFIG. 6 under reference 602. The tables 72 and 73 describe the successivesyntax elements used to code the block of levels 71. Table 73 should beread as the continuation of table 72. The syntax elements in the tablecorrespond to the encoding of the groups of levels surrounded by boldlines in the block 71.

The block of levels is encoded by group of successive pixels in scanorder. Each group is encoded using a first syntax element giving aprediction direction, a second element giving the repetition, and anoptional third element giving the value of the pixel, namely the level.The repetition corresponds to the number of pixels in the group.

These two tables represent the current syntax associated with thePalette coding mode. These syntax elements correspond to the encodedinformation inserted in the bitstream for the block of levels 71. Inthese tables, three main syntax elements are used to fully represent theoperations of the Palette coding mode and are used as follows whensuccessively considering the levels of the block of levels 71.

A first syntax element, called “Pred mode” makes it possible todistinguish between two encoding modes. In a first mode corresponding to“Pred mode” flag equal to “0”, a new level is used for the currentpixel. The level is immediately signalled after this flag in thebitstream. In a second mode corresponding to “Pred mode” flag equal to“1”, a “copy up” mode is used. More specifically, this means that thecurrent pixel level corresponds to the pixel level located at the lineimmediately above starting on the same position for a raster scan order.In that case of “Pred mode” flag equal to “1”, there is no need tosignal a level immediately after the flag because the value of the levelis known by reference to the value of the level of the pixel just abovein the block of levels 71.

A second syntax element called “Level” indicates the level value of thepalette for the current pixel only in the first mode of “Pred mode”, orthe level value for escape-coding of the pixel.

A third syntax element, called “Run”, is used to encode a repetitionvalue in both modes of “Pred mode”. Considering that the block of levels71 is scanned from the top left corner to the bottom right corner, rowby row from left to right and top to bottom, the Run syntax elementgives the number of successive pixels in block 71 having the sameencoding.

This “Run” syntax element has a different meaning which depends on the“pred mode” flag. When Pred mode is 0, “Run” element is the number ofsuccessive pixels of the block of indexes having the same level value.For example, if Run=8 this means that the current “Level” is applied tothe current pixel and to the following 8 pixels which corresponds to 9identical successive samples in raster scan order.

When Pred mode is 1, “Run” element is the number of successive pixels ofthe block of indexes having a level value corresponding to the levelvalue of their above pixel in block 71, i.e. where the “copy up” mode isapplied. For example, if Run=26 this means that the level of the currentpixel is copied from the pixel of the line above as well as thefollowing 26 pixels which corresponds to 27 pixels in total.

Tables 72 and 73 represent the nine steps to represent the block 71 byusing the Palette coding mode. Each step starts with the coding of the“Pred mode” flag which is followed by the “Level” syntax element when“Pred mode” flag equals “0”, or by the “Run” syntax element when “Predmode” flag equals “1”. The “Level” syntax element is always followed bya “Run” syntax element.

When the prediction mode decoded for the current block is the palettemode, the decoder first decodes the syntax relating to this block andthen applies the reconstruction process for the coding unit.

FIG. 8 illustrates the decoding process of syntax elements relating tothe Palette coding mode. First, the size of the palette is extracted anddecoded 802 from the bitstream 801. The exact size of the palette(Palette_size) is obtained by adding 1 to this size value decoded atstep 802. Indeed, the size is coded by using a unary code for which thevalue 0 has the smallest number of bits (1 bit) and the size of thepalette cannot be equal to 0, otherwise no pixel value can be used tobuild the block predictor.

Next the process corresponding to the palette values decoding starts. Avariable i corresponding to the index of the palette is set equal to 0at step 804 next a test is performed at step 805 to check whether i isequal to the palette size (Palette_size) or not. If it is different fromthe palette size at step 805, one palette element is extracted from thebitstream 801 (in case the palette is directly encoded in the bitstream)and decoded at step 806 and is then added to the palette with theassociated level/index equal to i. Then the variable i is incrementedthrough step 807. If i is equal to the palette size at step 805, thepalette has been completely decoded.

Next the process corresponding to the decoding of the block of levels 71is performed. First, the variable j, corresponding to a pixel counter,is set to 0 as well as the variable syntax_i 808. Then a check isperformed to know whether the pixel counter corresponds to the number ofpixels contained in the block. If the answer is yes at step 809 theprocess ends at step 817, otherwise the value of the flag “Pred mode”corresponding to one prediction mode is extracted from the bitstream 801and decoded 810.

The value of “Pred mode” is added to a table at the index syntax_icontaining all “Pred mode” value decoded. If the value of this “Predmode” is equal to 0, step 811, the syntax element corresponding to“Level” is extracted from the bitstream 801 and decoded 812. Thisvariable “Level” is added to a table at the index syntax_i containingall levels decoded. The variable j corresponding to the pixel counter isincremented by one 813.

Next the “Run” syntax element is decoded at step 814. If the syntaxelement “Pred Mode” is equal to 1, step 811, the “Run” value is alsodecoded at step 814. This syntax element “Run” is added to a table atthe index syntax_i containing all the runs decoded.

Next, at step 818, for each pixel that is escape-coded as indicated byits level (i.e. if the extracted Level equals the “escape coding” level,for instance “3” in the example of FIGS. 6 and 7), the associatedquantized pixel value is parsed and dequantized from the block ofescape-coded pixels. The dequantized pixel value is for instance storedin a corresponding table at the index syntax_i.

Note that step 818 may be performed just after step 812. In a variant,the whole block of escape-coded pixels may be extracted from thebitstream and dequantized in a step between step 809 and step 817.

Next at step 815, the value j is incremented by the value of the rundecoded at step 814. The variable syntax_i is incremented by one toconsider the next set of syntax elements. If the counter j is equal tothe number of pixels in the block then the syntax to build the block oflevels 71 is finished (817). At the end of this process, the decoderknows the palette, and the tables containing the list of all the “Predmode”, “Level” and “Run” syntax elements associated with the Palettecoding mode of this coding unit, and also knows the table of dequantizedpixel values for the escape-coded pixels. The decoder can then proceedwith the reconstruction process of the coding unit as described throughFIG. 5.

In a slight variant of this embodiment of FIG. 8, the “Pred mode”element is not provided for the first line of pixels at the top of theblock of levels 71. This is because, since these pixels are deprived oflevels at a line above, the “copy up” mode cannot be executed.Therefore, as long as j is less than the block width at step 809, no“Pred mode” element is provided and steps 810-811 are shortcut, therebydirectly performing step 812. Note that this slight variant decreasesthe size of the encoded block of levels.

In an embodiment that can be combined with either the above embodimentof FIG. 8 or its slight variant, several blocks of levels may begenerated instead of only one. This means that several levels are usedfor all or parts of the pixels. For instance, a first block of levelsmay be built for a first colour component (Y for example), while anotherblock of levels may be built for the at least one remaining component (Uand V for example). Of course, three blocks of levels for the threecolour components may be contemplated. The choice to have several blocksof level and their correspondence with the colour components may besignalled in the bitstream using specific flags. In a variant, this maybe implied by the colour format of the image.

Referring back to the palette, each palette element, constituted bythree values in the above examples, is generally encoded using threebinary codes. The length of the binary codes corresponds to thebit-depth of each colour component. The “Pred mode” element is encodedusing one bit. The “Level” element is encoded using binary code withbinary code length equal to b, where 2^(b) is the smallest integer equalor above the palette size.

FIG. 9 illustrates the reconstruction process to build the block oflevels 91. The input data of this process are the tables obtained usingthe process of FIG. 8 above, and containing the list of “Pred mode”,“Level” and “Run”.

An additional item of input data to the “Pred mode”, “Level” and “Run”elements is the size of the coding unit 801 (which is the same as thesize of the block of levels 602/71) known from the quadtree (FIG. 4)signalled in the bitstream.

In a first step 901, a variable i, representing a pixel counter, is setequal to 0 and a variable j, to successively consider each set of syntaxelements, is also set equal to 0. At step 904, the element Pred_mode[j]extracted from the table of “Pred mode” at index j is checked against 0.

If it is equal to 0, a new level is encoded for the current pixel i. Asa consequence, the value of the pixel at position i is set equal to thelevel at the index j from the table of levels; Block[i] =Level[j]. Thisis step 905. The variable i is incremented by one at step 906 toconsider the next pixel, and the variable k, dedicated to count thepixels already processed in the current Run, is set equal to 0 at step907.

A check is performed at step 908 to determine whether or not k is equalto the “Run” element of the table of runs at the index j: k=Run[j]?. Ifnot equal, the level of the pixel at position i is set equal to thelevel value of the pixel at position i−1: Block[i]=Block[i−1]. This isstep 909. The variable i and the variable k are then incremented by oneat respectively steps 910 and 911. If k=Run[j] at step 908, thepropagation of the left level value is finished and step 920 isperformed (described below).

If Pred_mode[j] is different from 0 at step 904, the “copy up” modestarts with the variable k set equal to 0 at step 912. Next, step 913checks whether or not (k−1) is equal to the “Run” element of the tableof runs at the index j: k=Run[j]+1? If not equal, the level value of thepixel at position i is set equal to the level value of the pixel atposition i of the above line: Block[i]=Block[i−width], where “width” isthe width of the block of levels (the same as the coding unit) asdeduced from the input size of the coding unit. This is step 914. Next,the variable i and the variable k are incremented by one at respectivelysteps 915 and 916. If k=Run[j]+1 at step 913, the prediction mode ‘copyup’ is completed and the process goes on at step 920.

At step 920, a check is performed to determine whether or not thevariable i is equal to the amount of pixels in the block 71/CU 601. Ifnot equal, the variable j is incremented by one at step 921 to considerthe next set of syntax elements and the process loops back to step 904described above.

If all the pixels have been processed at step 920, the final block oflevels 71 is obtained at step 922: this corresponds to table Block[].

Next, a final step 923 consists in converting each level in colourvalues using the palette 603 decoded using the process of FIG. 8 andusing block 604 of dequantized pixel values for the escape-coded pixels.This final step affects pixel values (Y, U, V) or (R, G, B) at eachblock position according to the level of this position in the block andeither the corresponding entry in the palette 603 if any, or thecorresponding dequantized pixel value in block 604.

As described above, the Palette coding mode as currently designed inHEVC SCC requires a palette to be transmitted for each coding unit. Thisrepresents a large amount of data in the bitstream, and thus a codingcost. In order to reduce that cost, some proposed mechanisms provide thecurrent palette for a current coding unit to be predicted using apalette predictor.

As proposed in Applicant's contribution JCTVC-Q0063, a reference palettepredictor can be transmitted in the bitstream to be used by each codingunit of a slice for instance; or the palette predictor can be builtusing pixels neighboring the coding unit processed; or the predictor canbe built from two or more palettes already existing.

The prediction process thus modifies step 806 of forming the palettefrom the bitstream.

FIG. 10 illustrates a prediction scheme including an exemplary iterativebuilding of a palette predictor. In this scheme, the palette predictorunder construction includes entries from a first palette which has beenpredicted based on a second palette (used as predictor) using a bitmapof flags, each flag of which defining whether or not a correspondingentry in the second palette is selected as an entry to predict an entryin the first palette. The bitmap of flags may be transmitted in thebitstream.

Particular to this embodiment is that the palette predictor is built byalso including the entries of the second palette corresponding to a flagof the bitmap that defines no selection of the entry to predict thefirst palette.

In reference to FIG. 10, three Coding Units, CU1 to CU3, are shown thatmay be consecutive coding units being processed in a current image.

Reference 1000 represents the palette used to process (encode or decode)CU1. This palette may have been encoded in the bitstream (and thusretrieved by the decoder) or predicted using any mechanism described inthe present application.

Palette 1000 is used as a palette predictor for building palette 1001 toprocess CU2. The prediction of palette 1001 is based on bitmap 1006 offlags. It is to be recalled that the flags take the value 1 or 0depending of the use or not, respectively, of the corresponding elementfor predicting the palette of a next CU. In a variant, flag=1 may meannot selecting the corresponding element, while flag=0 may mean selectingthe element for predicting the palette of the next CU.

As a result, in the present example, the first, third, fourth and fifthelements of palette predictor 1000 are copied into palette 1001 asdefined in the bitmap 1006. The second element 1002 is not reused(flag=0 in bitmap 1006). Note that an additional palette element 1003may have been added to the end of palette 1001 being built, based on themechanisms described above (e.g. explicitly transmitted in thebitstream).

Also, a palette predictor 1005 is built from palettes 1000 and 1001. Allthe elements of palette 1001 are copied (step 1004) into palettepredictor 1005 for CU3. In this example, the entries of palettepredictor 1000 corresponding to a flag of the bitmap that defines noselection of the entry to predict palette 1001 (i.e. usually withflag=0, for example element 1002), are added (step 1008) to palettepredictor 1005. This is because the other entries of palette predictor1000 are already in palette predictor 1005 thanks to the copying step1004. This selection of element 1002 can be performed very quicklythanks to the flags in bitmap 1006.

This approach makes that a next palette predictor for a next block ofpixels is built from only the current palette used to encode the currentblock of pixels and a current palette predictor used to predict thecurrent palette

A bitmap may be provided to predict, based on palette predictor 1005,the palette to process CU3.

Of course, palette predictor 1005 may also be directly the palette toprocess CU3. However, palette predictor 1005 continuously grows as itincludes all the elements defined in previous palettes, up to a limitdefining the maximum size of the palettes.

The addition of element 1002 is preferably performed at the end ofpalette predictor 1005. One may directly observe that the resultingpalette predictor is enriched compared to situations described above.

One particular advantage of adding the unused elements at the end of thepalette predictor is that the elements are approximately ordered bytheir age and their level of use. This results in having the lastelements in the palette predictor that are the least useful ones and themost likely to be removed. A decision can thus be taken to remove someelements from the palette predictor under construction, for examplebased on the number of uses of this element when processing to the lastM (M integer to be defined) blocks of pixels using respective palettesthat include this element.

Of course, this process can be adapted so as to put unused elementsfirst in the palette predictor, or even interleaved with some of theelements from palette 1001.

Note that the selection of unused elements from a previous paletteguarantees that the elements are unique, and therefore the flags in thebitmap are not redundant. The palette predictor efficiency is thusmaximized.

However, there are situations that currently break the current paletteprediction scheme.

Some of those situations are related to the use of HEVC codingtools/structures aimed at error resilience and/or parallel processing.These tools/structures usually disallows any dependency between codingstructures inside an image.

It is reminded here that the image is usually recursively split intohierarchical coding structures, for instance, tiles made of slices, withslices made of CTBs, each of which is split into CUs as shown in FIG. 4.The parameters defining the hierarchical coding structures are generallycontained in the Sequence Parameter Set (i.e. valid for the sequence)and/or the Picture Parameter Set (i.e. that can be updated). Thus, thecoding structures must refer to the information stored in these SPS andPPS by indicating an ID of said SPS/PPS, which is an integer coded usinga variable-length scheme.

The absence of dependency between some coding structures means forinstance that no INTRA prediction can be performed at the boundaries ofthe coding structure, and no entropy coding state, palette predictor orarea for IBC prediction can be shared between coding structures.

As briefly mentioned above, one of such coding structures is the tilestructure, which splits an image into different rectangles containingfull CTBs. Whether the sequence uses tiles, and the shape of the tiles,are usually contained in the SPS.

The tile rows or columns may not be homogeneously distributed. This isthe case in image 1100 of FIG. 11, which is split in four tiles 1102,1103, 1104 and 1105.

Another already-mentioned coding structure is the slice structure. Theslice is the base coding structure above the CTB, meaning that a sliceis made of one or more CTBs, and a tile is made of one or more slices,and an image can be made of one or more tiles (and thus slices).

As an example, image 1110 of FIG. 11 contains slices 1111, 1113, 1114etc. In particular, slice 1114 can be seen to contain only one CTB.

Each slice includes a slice header that comprises (in no particularorder): a piece of information regarding the starting CTB address (inraster scan) which depends on the CTB size and tile configuration, theIDs of the SPS and PPS on which the slice depends.

HEVC provides that the tiles and slices are “self-contained”, i.e. theyare encoded/decoded independently of each other tiles and slices,respectively. The present invention focuses on such self-containedcoding structures.

To be noted that some specific cases provides that a group of slices maybe marked as actually fully dependent, meaning that some codinginformation are inherited from one slice to the next slice. In thesecases, the present invention only focuses on the first slice of the setof dependent slices.

To further illustrate the “self-contained” feature of the slicestructure, one can refer to image 1120, which contains four homogeneoustiles (delimited by bold lines), each tile containing slices (havingdifferent filling patterns) with varying CTB counts.

Because a non-dependent current slice or a tile cannot refer to anotherslice or tile respectively, errors in the other slices or tiles do notimpact the decoding of the current slice or tile. In addition, thecoding results for the current slice or tile do not depend on theseothers slices or tiles. So, they can be encoded or decoded in parallel.

One drawback of the “self-contained” property is that data useful toprediction are no longer unavailable when switching to a new slice ortile, therefore reducing coding efficiency. This is even more the casewith SCC, in which there is a high level of information redundancywithin a single image. It is therefore desirable in those cases toalleviate some of that coding efficiency loss.

In this context, the present invention provides the following steps:

obtaining, from the bitstream, a palette predictor initializerassociated with a coding structure hierarchically above the twoself-contained coding structures to be decoded; and

initializing the palette predictor for each of the two self-containedcoding structures using the same obtained palette predictor initializer.

Symmetrically at the encoder's end, the present invention provides thefollowing steps:

determining a single palette predictor initializer to initialize thepalette predictor for the two self-contained coding structures; and

in the bitstream, providing the encoded data including the predictioninformation to predict the palette associated with each processed pixelblock from a palette predictor and providing the palette predictorinitializer, wherein the palette predictor initializer is associatedwith a coding structure hierarchically above the two self-containedcoding structures in the bitstream.

As proposed by the present invention, a palette predictor initializer isused to simply initialize the palette predictor, which quite providesgood results in terms of both coding efficiency and complexity. One maynote that the palette predictor initializer is never used as a paletteitself for performing the Palette coding mode.

Also, the present invention provides that the palette predictorinitializer is “global”, meaning that it is signalled once in thebitstream while it is used by several independent coding structures,tiles or slices. This is achieved by signalling it in association with acoding structure hierarchically above the coding structures requiringinitialization of their palette predictor due to the “self-contained”property.

Storing it at the slice level, i.e. at the same level as the codingstructures (slices) requiring it, appears to be inefficient to theinventors. This is because the split of the image into slices is thevery reason for a loss of coding efficiency.

The description below intends to propose efficient storage andtransmission mechanism for said initializer.

In one embodiment, the palette predictor initializer is defined (andthus transmitted in the corresponding part of the bitstream) at theimage level in the Picture Parameter Set, PPS, in which case the twoself-contained coding structures refer to the Picture Parameter Set. Forinstance, two self-contained slices include the PPS ID within theirrespective header.

In a variant, the palette predictor initializer is defined at a sequencelevel in a Sequence Parameter Set, SPS, in which case the twoself-contained coding structures refer to the Sequence Parameter Set.

Preference is given to its definition in the PPS. This is becausestoring it at the SPS level disallows several encoder optimizations suchas updating the initializer after a certain amount of frames or time,and/or using an initializer per area of an image (e.g. tile or arbitraryarea).

However, as mentioned above, a slice refers to a PPS through its PPS ID.The more PPSs are sent, the larger the IDs become and thus the more bitsare required to encode them. It is not forbidden but strongly suggestedby the standardization organisations not to have several PPSs sharingthe same ID: indeed, it would be possible to decode them in an incorrectorder and associate incorrect information to slices. A potentialsolution to this issue is a wraparound mechanism: when reaching a valueMAX, the PPS ID is reset to 0. While this does not fully preventincorrect decoding, it greatly reduces the risks, as the PPSs with sameID can now be distant by an arbitrary duration.

Reference is now made to FIGS. 12 to 14 to illustrate embodiments of theinvention.

FIG. 12 illustrates exemplary processing at the decoder's end andincludes FIG. 12a illustrating the retrieval of a palette predictorinitializer from a sequence's bitstream 1200.

A syntax structure associated with a coding structure of highhierarchical level is extracted and decoded from the bitstream at step1201. This syntax structure may be the SPS associated with the sequence,or the PPS associated with images.

Next, the ID for that syntax structure is deduced at step 1202: it isthe PPS ID for a PPS and the SPS ID for an SPS.

Next, the number of entries in the palette predictor initializer is readfrom the extracted syntax structure at step 1203. To be noted that themaximum size of the palette predictor to be used by the Palette codingmode is specified in the SPS, and thus the size indicated by theextracted syntax structure is subject to that limit, meaning it is lessor equal to this maximum size.

In the case where the extracted syntax structure is the SPS, the palettepredictor initializer is preferably located after information definingwhether or not the Palette coding mode is activated for the sequence,and also after the maximum size of the palette predictor. Thisparticular location makes it possible to avoid parsing and reading thepalette predictor initializer data (the number of entries of theinitializer) if the palette mode is deactivated (for instance if theextracted syntax structure is tailored for coding of natural content,and not for screen content).

At step 1204, the process determines, based on the number of entriesread at step 1203, whether the palette predictor initializer has entriesor not.

If it comprises at least one entry, the entry or entries are obtainedfrom the bitstream at step 1205. The mechanism to read the palettepredictor initializer from the bitstream (the extracted syntaxstructure) may be similar to those defined in HEVC SCC to read anypalette transmitted in the bitstream.

Once the palette predictor initializer has been fully determined, it isstored in memory and associated with the ID of the extracted syntaxstructure (i.e. the ID obtained at step 1202) at step 1206. This storingallows retrieving easily the palette predictor initializer when the IDis used once again later on.

FIG. 12b show the same decoding process as FIG. 5 in a simpler way, butadapted to the present invention.

Steps 1211 to 1217 are similar to conventional steps of the decoder.Steps 1220 and 1221 are specific to embodiments of the presentinvention.

In this decoding process, bitstream 1200 is parsed at step 1211 toobtain information about the current coding structure. This informationmay for instance define the nature of the current coding structure, forinstance whether it is a frame, a slice, a tile, etc.; and theinformation may also specify which pixel block (CU or CTB) is the firstblock of the current coding structure. This is because the presentinvention is dedicated to initialization, i.e. to a process that isusually performed for the very first part of the considered codingstructure.

In an HEVC-related embodiment, the pixel block considered is a CTB. Thisallows initializing the decoding loop for the current coding structureby selecting the first CU at step 1212. Next, the current CU is decodedat step 1213 possibly using palette predictor 1215 (to obtain thecurrent palette) if the CU is encoded using the Palette coding mode.

In a particular embodiment relying on palette sharing (i.e. using thelast used palette as the palette to be used for the next palette-encodedpixel block), the last used palette has been copied into the startingpart of the palette predictor for the next pixel block (which palettepredictor may also have received other entries). To signal the number offirst entries (i.e. that come from the last used palette) of the palettepredictor to copy to form the next palette and thus to facilitate theirretrieval from the predictor, the palette predictor 1215 also holdsinformation of the last used palette size, denoted N. Indeed, by simplycopying the N first entries of the palette predictor into the nextpalette, the next palette in the palette sharing mode is fully built.

At step 1214, the palette predictor is updated if appropriate, forinstance as explained above with reference to FIG. 10 or by copying eachentry of the current palette in case of palette sharing. The decodingloop over all the CUs is obtained through steps 1216 and 1217.

According to the invention, the palette predictor 1215 is initializedusing a palette predictor initializer, when starting encoding ordecoding a new self-contained coding structure. To achieve this, whenparsing (or writing when encoding) bitstream 1200, an identifier ID of asyntax structure associated with a coding structure of high hierarchicallevel is obtained at step 1220. This may happen by extractinginformation from bitstream 1220 before or after information 1211 isparsed, but before first CU 1212 is decoded.

This identifier ID allows retrieving the palette predictor initializerat step 1221, which has been previously stored using the identifier atstep 1206 of FIG. 12a . This identifier may be a new syntax element. Inone embodiment where the coding structure parsed is a slice and thepalette predictor initializer is stored in a PPS, the already existingsyntax element identifying the PPS for said slice plays this role.

In another embodiment where step 1221 happens at the start of everyslice and the palette predictor initializer is associated with tiles(i.e. defined at the tile level), each slice may identify (using an ID)the tile to which it belongs. In this embodiment, step 1220 thusidentifies to which tile the current slice belongs, and then retrievesthe palette predictor initializer for the ID of the associated tile.

At the end of step 1221, the palette predictor initializer has beenretrieved. It can be used once to initialize palette predictor 1215 justbefore the first CU of the current coding structure (e.g. slice) isdecoded. This may be performed by setting the number of entries in thepredictor from the number of entries of the initializer. These two sizesmay not be equal, as a maximum size may be imposed (either from the SPSmaximum predictor size or an arbitrary one). Then, the entries arecopied from the palette predictor initializer to the palette predictor,according to the number of entries in the predictor that has just beenset.

In a further embodiment, the size of the previous palette is 0, as no CUhas been decoded. However, as the palette predictor initializer providesa palette, said size of the previous palette may be derived from thesize of the palette predictor initializer, e.g. the minimum between themaximum palette size (cf. palette_max_size on FIG. 14a ) and the paletteinitializer size. This further embodiment operates when a palettesharing is for instance implemented, i.e. when, through the processingof a coding structure, the next palette used to encode the next pixelblock or CU reuses all the entries of the last palette used for the lastpalette-coded pixel block or CU.

The above explanation shows that the palette predictor initializer isdefined at the level of a coding structure which has a hierarchicallevel strictly higher than the one of the slice (e.g. SPS, PPS, tile,etc.) and it is then associated at the level of the slice.

Turning now to algorithms at the encoder's end to determine such apalette predictor initializer, FIG. 13 illustrates an exemplaryalgorithm for initializer determination, which algorithm has benefits ofcoding efficiency, computation load control and low delay properties(i.e. the results are obtained for the current frame without impactingtoo much the encoder delay in outputting data).

This algorithm works by performing more or less fast encoding of asubset of the CTBs, preferably spread over an image area correspondingto the self-contained coding structure considered (e.g. slice). Toachieve that fast encoding, different shortcuts can be enabled, forinstance, early termination (e.g. in INTER or when there would be toomany escape-coded pixels when testing Palette mode) or modifyingthresholds causing further analysis (e.g. to investigate furtherpartitioning for IBC). One of the palette predictors obtained at the endof the fast encoding on the subset of CTBs may be used as the palettepredictor initializer which is transmitted in the bitstream.

FIG. 13a displays examples of such subsets of pixel blocks for theinitializer determination.

Ideally, the CTBs are regularly spaced so as to be representative of thearea (e.g. slice) as much as possible. Preferably the CTBs consideredfor the subset are not on an edge (left/top/bottom/right) of the area orimage, as their content might be more easily encoded using other codingmodes than the palette coding mode (e.g. hard edges of user interfacesare better encoded with INTRA angular prediction).

Also, the CTBs considered for the subset are preferably not horizontallyor vertically aligned. Otherwise, they may belong to the same frame-widestructure.

In a first embodiment 1301 shown in the left part of the Figure, thepixel blocks of the subset are distributed along a slope or a diagonalof the area. In this example, the subset is made of the dark CTBs. Thisexample follows all the properties mentioned above.

It is considered that this first exemplary subset 1301 is well suited toareas where only one palette predictor initializer must be determinedfor more than one slice.

In a first embodiment 1302 shown in the right part of the Figure, thepixel blocks of the subset are horizontally aligned on the top of theimage area, preferably on the top of the image. This embodiment isbetter tailored for cases where the higher level structure (image ortile) contains a single self-contained coding structure, e.g. a singleslice, and the palette predictor initializer thus obtained is bettersuited to encode the start of said higher level structure.

In particular, tailoring it for another part of the image would indicatea possibility to forcibly reset the palette predictor during the sliceencoding. The benefits of the palette predictor initializer then stemsfrom the fact that it will be used for several frames (and thus severalslices).

Therefore, the CTBs forming the subset 1302 are rather concentrated atthe start of the image, where the palette predictor is usually empty.

In that case, analysing CTBs that are far from the image start mayresult in palette predictor elements that will be flushed by the updatemechanism 1214 of FIG. 12 b.

In addition, selecting CTBs too close to each other may cause picking uponly slightly different and rarely occurring colours. Preference is thusgiven to select pixel blocks that are not contiguous, for instant bydefining a step between the CTBs considered that is equal to or largerthan 1, as shown in 1302.

Based on the subset of CTBs, FIG. 13b illustrates, in a flowchart,general steps for determining a palette predictor initializer at theencoder's end.

The process starts at step 1311 by determining the block subset, takinginto account the use of tiles, slices, and the area on which it isapplied and so on.

In particular, as described with reference to FIG. 11, the image may beartificially split into areas, or split into conventional tiles orslices. In that case, the algorithm may be applied to each area, andthen, when encoding the coding structures, e.g. slices, it is determinedto which higher-level area the coding structure belongs (it may notcompletely belong to said area).

This approach makes it possible to obtain the starting and end points ofthe area based on which the subset blocks, such as examples 1301 and1302, are defined.

Another parameter that can be taken into account when determining thesubset is an allowed number of blocks or CTBs. For instance, the numberof blocks in the subset may not be more than a predetermined number(e.g. 10) or a ratio of the considered area (e.g. 10%).

Next to step 1311, step 1312 provides that the encoder parameters areinitialized. This may involve all the classical determinations(quantization matrices, quantizer steps, allowed coding modes, etc.). Inparticular, this may also involve setting fast analysis parameters, e.g.a reduced search for Intra Block Copy, the removal or speed-up of somecoding modes (including the Palette coding mode), etc.

Next, at step 1313, the first block of the subset is selected.

At step 1314, the current block is encoded. As mentioned previously, theencoding process may be slightly modified by step 1312 to offer areduced workload. This may also involve setting up specific encodingparameters for this block: for instance, there is no encoded pixel onthe borders of the block, and intra prediction methods cannot operatefor such boundary pixels, and is thus disabled during analysis for thosepixels.

Furthermore, using a subset of CTBs may cause issues in the Intra BlockCopy analysis. All of these can be addressed during step 1314.

At step 1315, the palette predictor generated for the current block isretrieved and saved for later reference.

Next, at step 1316, a test is performed to determine whether or not theanalysis is complete.

This determination may be based on a time budget. If the time budget hasbeen fully used, the analysis stops.

Also, referring to the possible flush of elements from the palettepredictor at step 1214 of FIG. 12b , it could be interesting detectingsuch flush during analysis so to decide when stopping the analysis.

For instance, when considering exemplary subset 1302, it is highlyinteresting to stop the analysis quickly enough, as the new entries mayactually rarely be used. For instance, said analysis may be stoppedimmediately when a flush is detected, or a flush counter may bedecremented at each new element being flushed away, until the counterreaches 0 and indicates the end of the analysis.

In the case of exemplary subset 1301, this approach is less interesting,because the colours in the palette predictor initializer need to bedefined for as many CTBs as possible. It is therefore interesting tokeep the most frequently used (because it is believed that they will beuseful for several slices).

In any case, if step 1316 determines that the analysis should bestopped, the algorithm ends at step 1319, which will be described later.Otherwise, step 1317 tests whether or not the last block of the subsethas been processed. If it has been, step 1319 occurs to end thealgorithm. Otherwise, the next block in the subset is selected at step1318, and the analysis process loops back to step 1314.

In a particular embodiment, this encoding of the subset may be repeated,several times in order to obtain each time better palette predictors forthe blocks, and thus to use the Palette coding mode more often: thisrepetition comprises recursively encoding the same subset of block ofpixels, wherein the first palette predictor used for the next recursiveencoding loop is the palette predictor obtained at the end of theprevious recursive encoding loop.

At the end 1319 of the analysis, several operations are performed.

The main operation is to set the palette predictor initializer, encodeit and transmit it in the bitstream.

This requires selecting one of the palette predictors for use as thepalette predictor initializer. For instance, it may be the last palettepredictor of the analysis.

Next, the selected palette predictor initializer may be controlled todetermine whether or not it is actually good for encoding.

For instance, if there are two few entries (e.g. less than four) in it,this may indicate that there is mostly natural content in the areaanalyzed, in which case it is not worth using the Palette coding mode.This information may thus serve to deactivate the palette coding mode inregular encoding, until another analysis obtains a better result.

Another case is when the selected palette predictor is not differentenough (e.g. is included) from the palette predictor initializer that iscurrently in use for the area, in which case the palette predictorinitializer currently in use is kept instead of the newly determinedone.

Another operation is to filter out the entries of the palette predictorselected in case they are useless, for instance based on a frequencycriterion (e.g. some colours that occurred for only one block) or asimilarity criterion (a colour is very similar to another in the palettepredictor initializer).

Another embodiment is to derive the entries of the selected palettepredictor once again, to be representative of the CTBs analyzed as muchas possible. For instance, a more classical classification algorithm maytake the palette entries found as a start point, and determine theactual centroid for each of the classes associated with said entries,using for instance a Kmeans algorithm.

FIG. 14 illustrates two embodiments for declaring or defining thepalette predictor initializer, in particular within the SPS in FIG. 14a, and within the PPS in FIG. 14b . The two embodiments are quitesimilar; thus a single combined description is given below.

Both embodiments rely on an existing extension section of the PPS andSPS syntax structures in the HEVC standard and its SCC Extension (seedocument JCTVC-S1005). The presence of the corresponding extensionsections (namely “sps_scc_extensions” and “pps_scc_extensions”) isindicated in the SPS and PPS, by the flags sps_scc_extensions_flag andpps_scc_extensions_flag respectively.

In the two embodiments, relevant palette predictor initializerinformation is added to respectively the SPS SCC extension and the PPSSCC extension.

The syntax elements added to the existing extension section are shown inbold in FIGS. 14a and 14b . The name, location or type of information ofthese additional syntax elements are for illustrative purposes. Ofcourse, other names can be used.

As mentioned above with reference to step 1204, the Palette coding modecan be deactivated. As a consequence, the invention parses theinformation relating to the palette mode only if thepalette_mode_enabled_flag is right, or if equivalent information at theSPS or PPS level indicates that the Palette coding mode is activated.

Based on the example of the Figures, a first flagpalette_predictor_initializer_present_flag may be used. It indicateswhether the palette predictor initializer is present (i.e. actuallydefined in the SPS or PPS SCC extension).

If it is present, its size is known and is at least 1. Its maximum sizeis variable, but can be limited to be below a maximum size indicated inthe SPS or PPS SCC extensions (see palette_max_predictor_size).

The VLC size minus 1 (VLC for variable length coding, for instance usingstandard-specified Exp-Golomb codes) is specified using a correspondingfield: size_palette_predictor_initializer_minus1. It is the size of thepalette predictor initializer.

Next, the values of the entries of the palette predictor initializer aredefined. Although not depicted here, preference is given to use abyte-aligned coding to encode these values: this allows easier parsingof the SCC extension to be done. In an embodiment, they are coded aselements of fixed length, with N[comp] (see below) for the componentcomp of each entry.

To be noted that the number of components num_comp of the entries isknown: information such as chroma_format_idc orseparate_colour_plane_flag included in the SPS allows determining thenumber of components. Also, the number of bits N[comp] for eachcomponent is also known, as they can be derived from the syntax elementsbit_depth_luma_minus8 and bit_depth_chroma_minus8 included in the SPS.

Last, FIG. 14c illustrates a way to provide a list of palette predictorinitializers, for use when components are encoded separately, or thattiles are used. A case where components are not jointly coded is 4:2:0color format, where a palette may be defined for luma (one singlecomponent) and another for chroma (two components).

Another case where such a list is needed is when there is a number N oftiles, and the association 1221 between the slice and the paletteprediction initializer is made through the tile to which the slicebelongs.

In each case, the list can be determined by information belonging toeither SPS or PPS. So the syntax structure loops over each set of thelist of initializers, of size num_sets. For each set, the differentinformation already presented, such as

palette_predictor_initializer_present_flag[set], and

size_palette_predictor_initializer minus1[set],

are sent.

Then, the number of components num_comps[set] for said initializer andthe list comp_list[set] of components allows determining the componentsto use and how to read the values of the palette predictor initializerfor each set.

In the case of tile, this is just the regular list of components. Incase of a specific color format, this allows specifying a palettepredictor initializer per set of independent components.

In another embodiment, the syntax used by the invention isadvantageously decoupled from other information coming from e.g. theSPS. This allows separate handling by a decoder and easier setup schemesin a video streaming scenario for example. In such case, it may beimportant to provide information that is duplicated, e.g. if, asillustrated, the palette predictor initializer is transmitted in a PPS,then this PPS may duplicate information from the SPS, while requiringthat said information has the same meaning. This embodiment isillustrated in FIG. 14d . Some parts of FIG. 14d are common to someparts of FIG. 14c . The supplementary information comprises a first flagmonochrome_entries_flag or an equivalent parameter, allowing to deducethe number of components. Another embodiment is to repeatchroma_format_idc and/or separate_colour_plane_flag, or derivedinformation thereof. This information shall match what is transmitted atany other level such as the SPS, so that the number of components thatis inferred from this information correspond to the number of componentsof the image that refers the pps_scc_extensions and its PPS. One canfurther put that requirement on the bitstream and its conformance tospecifications of a standard using an embodiment of the invention.

When the number of components is known, further information can beobtained. In particular the bitdepths of the components can betransmitted. It is typical to transmit separately luma and chromabitdepths, which is the case with luma_bit_depth_entries_minus8 andchroma_bit_depth_entries_minus8. Indeed, the signal has 8 or more bitsof depth, so only transmitting the number of additional bits over 8 iswhat is typically signaled. One important consideration is that thosevalues ideally match the actual bitdepths of the image that refers thePPS, e.g. BitDepth_(Y) and BitDepth_(C), as found in the HEVCspecifications, and can be considered a further requirement on theconformance of the bitstream. As we transmitted information allowingdeducing the number of components, parsing ofchroma_bit_depth_entries_minus8 may be made conditional.

When all information required to read the palette predictor initializerentries are known, the reading of entries, as already explained inprevious FIG. 14a to FIG. 14c can occur. This is conditioned by thevalue of monochrome_entries_flag or equivalent syntax information. Atypical embodiment is to either read one or three components per palettepredictor initializer entry, as depicted on FIG. 14 d.

Conversely, the retrieved palette predictor initializer on step 1221also contains the number of components and the required storage perentry, thereby clearly determining how to copy said initializer to theactual palette predictor in step 1215.

Conventional mechanisms to extract the entries of the initializer fromthe SPS or PPS SCC extensions can be used.

Several ways to initialize a palette predictor (FIG. 12) on the decoderside have been described, as well as how to find the palette predictorinitializer on the encoder side (FIG. 13) and how to embed it in thebitstream (FIG. 14). In a preferred embodiment, the palette predictorinitializer is stored in a PPS, and the block structure is the slice.

First experimentations of the invention by the inventors have shown a1.8% gain in coding. However, it is believed that better gains may beobtained depending on encoding parameters and on the image content toencode.

FIG. 15 illustrates an existing process for declaring or defining thepalette predictor initializer within the standard specification asdescribed in JCTVC-T1005. This embodiment relies on an existingextension section of the PPS syntax structure in the HEVC standard andits SCC Extension (see document JCTVC-T1005). The presence of thecorresponding extension section (namely “pps_scc_extensions”) isindicated in the PPS, by the flag pps_scc_extensions_flag.

It firstly contains information relating to the “residual adaptivecolour transform” tool (referred to as “ACT” from now on), which appliesa revertible predetermined colour transform to the decoded output block.This tool can be disabled at the PPS level by setting the flagresidual_adaptive_colour_transform_enabled_flag to 0.

If it is not disabled, then addition information follows. A flagpps_slice_act_qp_offsets_present_flag indicates whether quantiser stepoffsets (compared to the ones set for the slice that uses current PPS)are present, in which case these offsets, pps_act_y_qp_offset_plus5,pps_act_cb_qp_offset_plus5, and pps_act_cr_qp_offset_plus3 aretransmitted as variable-length elements.

Then a first flag related to the palette modepalette_predictor_initializer_present_flag is used. It indicates whetherthe palette predictor initializer is present (i.e. actually defined inthe PPS SCC extension as mentioned above).

If it is present, then information regarding the entries of thisinitializer are transmitted. Firstly, the colour format information. Itis usually a three components or a monochrome format. A flagmonochrome_palette_flag indicates if the format comprises only one colorcomponent if set to a predetermined value, for example 1. If not set tothis value, the format is not monochrome.

Then, the bitdepth of the first (and potentially only) component istransmitted on a variable number of bits by the syntax elementluma_bit_depth_entry_minus8. As the bitdepth of any component cannot belower than 8, only the difference of said bitdepth with 8 needs to betransmitted (thereby saving a few bits). Then, if the entries are notmonochrome, the bitdepth for chroma is transmitted through the syntaxelement chroma_bit_depth_entry_minus8.

Then, as it is known palette entries are transmitted, their number isknown, and is at least 1. Its value is transmitted through thevariable-length syntax element:num_palette_predictor_initializer_minus1. It is the size of the palettepredictor initializer.

Next, the values of the entries of the palette predictor initializer aredefined. To be noted that the number of components numComps of theentries is known and is 1 when monochrome_palette_flag is 1 and 3otherwise. Also, the number of bits for each component is also known, asthey can be derived from the syntax elements luma_bit_depth_entry_minus8and chroma_bit_depth_entry_minus8 included in the SPS.

The proposed syntax is redundant and may even be source of faults. Byauthorizing contradictory configurations, the current syntax is notefficient enough.

As proposed below, the information in the PPS extension can be improvedregarding the use of the palette mode. FIG. 16 illustrates an example ofsuch an improvement.

According to an embodiment, a parameter like a flag called here“monochrome_flag” is sent before either the palette or ACT toolinformation is transmitted. In other words, the proposed“monochrome_flag” is defined at the PPS level. As a variant, themonochrome flag may be defined at a sequence level. If themonochrome_flag is set to a predetermined value, for example “1”, thenwhen considering the palette predictor initializer, the palette entriesare directly adjusted for a monochrome format (in other words that thestep for defining the palette predictor initializer is amended given thepalette predictor initializer comprises only one element per entry).There is no more need of a parameter, specific to the palette predictorinitializer, for signalling the colour format in order to adapt thenumber of entries. The invention according to one of its aspect,proposes to use a parameter defined at the picture (or image) level ofat a higher level.

In a preferred embodiment, when the “monochrome_flag” is set to “1”,then the ACT tool is disabled (in other words the step of reading thevalue of the “residual_adaptive_coulour_transform_enabled_flag” isskipped, disabling the ACT tool), given that tool become useless. Inthat case the flag residual_adaptive_colour_transform_enabled_flag isinferred to be 0. On the opposite, if monochrome_flag's value is 0, thenthe ACT tool may or may not be enabled, therefore its corresponding flagis transmitted. Similarly, the palette entries number of componentsnumComps is 3.

According to another embodiment, a simpler syntax is proposed so thatthe monochrome_flag impacts only one mode at a time, preferably thepalette mode. Such an example would be in case the palette mode is knownto be deactivated by another mean.

An example of such an embodiment is illustrated in FIG. 17. In thatcase, a condition (for example a single condition) is introduced beforereading flag monochrome_palette_flag presented in FIG. 10. If the ACTtool is activated (as indicated by the value of its corresponding flagresidual_adaptive_colour_transform_enabled_flag), then the pixel colourformat is deduced as being not monochrome: there are threecolor-components. The flag monochrome_palette_flag's value can bedirectly inferred to be “0”. On the contrary, if the ACT tool isdisabled, the format may or may not be monochrome.

In another embodiment it is proposed an encoder-only constraint, so asto not modify the decoder logic. The two following conditions must besatisfied: if residual_adaptive_colour_transform_enabled_flag is 1, thenmonochrome_palette_flag must be 0. And if monochrome_palette_flag is 1,residual_adaptive_colour_transform_enabled_flag must be 0.

In another embodiment it is proposed to decorrelate the actual pixelformat from the number of components of the entries. In the previousembodiment, the palette predictor initializer is set to have entrieshaving a different number of components according to the pixel format.In this embodiment the same palette predictor initializer may be able tobe used with monochrome data and RGB or YUV data. As a consequence, bothpalette predictor and palette predictor initializer may have entrieswith one to three elements depending on the color format. The number ofelements per entry may be different for the palette predictor andpalette predictor initializer. In such case, when initializing thepalette predictor with the predictor initializer, various rules may beapplied. For instance, when going from one component to three, thepalette predictor entries predictor[i] are initialized with defaultgreyscale values or existing palette predictor initializer entries. Forinstance,

-   -   For RGB, predictor[i][2], predictor[i][1] and predictor[i][0]        are set equal to palette_predictor_initializers[i][0];    -   For YUV, predictor[i][0] is set equal to        palette_predictor_initializers[i][0], and predictor[i][2] and        predictor[i][1] are set equal to a specific value of the        component (i.e. 0, 128 or 255 for a component whose values are        between 0 and 255).

Other variations as possible, i.e. when going from three to onecomponent, when coding a given color plane for a component of index comp(for instance U if YUV format is considered), predictor[i] is set topalette_predictor_initializers[i][comp]. Conventional mechanisms toextract the entries of the initializer from the PPS SCC extension can beused. Several ways to define a simplified syntax removing redundancybetween the palette mode and other existing tools on the decoder sidehave been described.

FIG. 18 is a schematic block diagram of a computing device 1800 forimplementation of one or more embodiments of the invention. Thecomputing device 1800 may be a device such as a micro-computer, aworkstation or a light portable device. The computing device 1800comprises a communication bus connected to:

-   -   a central processing unit 1801, such as a microprocessor,        denoted CPU;    -   a random access memory 1802, denoted RAM, for storing the        executable code of the method of embodiments of the invention as        well as the registers adapted to record variables and parameters        necessary for implementing the method for encoding or decoding        an image according to embodiments of the invention, the memory        capacity thereof can be expanded by an optional RAM connected to        an expansion port for example;    -   a read only memory 1803, denoted ROM, for storing computer        programs for implementing embodiments of the invention;    -   a network interface 1804 is typically connected to a        communication network over which digital data to be processed        are transmitted or received. The network interface 1804 can be a        single network interface, or composed of a set of different        network interfaces (for instance wired and wireless interfaces,        or different kinds of wired or wireless interfaces). Data        packets are written to the network interface for transmission or        are read from the network interface for reception under the        control of the software application running in the CPU 1801;    -   a user interface 1805 may be used for receiving inputs from a        user or to display information to a user;    -   a hard disk 1806 denoted HD may be provided as a mass storage        device;    -   an I/O module 1807 may be used for receiving/sending data        from/to external devices such as a video source or display.

The executable code may be stored either in read only memory 1803, onthe hard disk 1806 or on a removable digital medium such as for examplea disk. According to a variant, the executable code of the programs canbe received by means of a communication network, via the networkinterface 1804, in order to be stored in one of the storage means of thecommunication device 1800, such as the hard disk 1806, before beingexecuted.

The central processing unit 1801 is adapted to control and direct theexecution of the instructions or portions of software code of theprogram or programs according to embodiments of the invention, whichinstructions are stored in one of the aforementioned storage means.After powering on, the CPU 1801 is capable of executing instructionsfrom main RAM memory 1802 relating to a software application after thoseinstructions have been loaded from the program ROM 1803 or the hard-disk(HD) 1806 for example. Such a software application, when executed by theCPU 1801, causes the steps of the flowcharts shown in FIGS. 13, 14, 16and 17 to be performed.

Any step of the algorithms shown in FIGS. 13, 14, 16 and 17 may beimplemented in software by execution of a set of instructions or programby a programmable computing machine, such as a PC (“Personal Computer”),a DSP (“Digital Signal Processor”) or a microcontroller; or elseimplemented in hardware by a machine or a dedicated component, such asan FPGA (“Field-Programmable Gate Array”) or an ASIC(“Application-Specific Integrated Circuit”).

Although the present invention has been described hereinabove withreference to specific embodiments, the present invention is not limitedto the specific embodiments, and modifications will be apparent to askilled person in the art which lie within the scope of the presentinvention.

Many further modifications and variations will suggest themselves tothose versed in the art upon making reference to the foregoingillustrative embodiments, which are given by way of example only andwhich are not intended to limit the scope of the invention, that beingdetermined solely by the appended claims. In particular the differentfeatures from different embodiments may be interchanged, whereappropriate.

In the claims, the word “comprising” does not exclude other elements orsteps, and the indefinite article “a” or “an” does not exclude aplurality. The mere fact that different features are recited in mutuallydifferent dependent claims does not indicate that a combination of thesefeatures cannot be advantageously used.

1. A method of decoding at least one image from a bitstream, the imagebeing split into hierarchical coding structures including at least oneslice, the method comprising: decoding encoded data of the slice, usinga palette coding mode, the palette coding mode using, for each ofprocessed pixel blocks of the slice, an associated palette thatcomprises a set of entries associating respective entry indexes withcorresponding pixel values, wherein the palette associated with eachprocessed pixel block is predicted from a palette predictor usingprediction information from the bitstream; obtaining, from thebitstream, information about a number of color components and a palettepredictor initializer associated with a coding structure hierarchicallyabove the slice, the structure of the palette predictor initializerbeing based on said information about the number of color components;and initializing the palette predictor for the slice using the obtainedpalette predictor initializer wherein each palette predictor subsequentto the initialized palette is built from a current palette associatedwith a block currently being decoded and the palette predictor used forpredicting the current palette.
 2. A method of encoding at least oneimage into a bitstream, comprising: obtaining hierarchical codingstructures by splitting the image; encoding data of the codingstructures of the image to obtain an encoded slice, wherein saidencoding uses a palette coding mode, the palette coding mode using, foreach of block of pixels of the slice, an associated palette thatcomprises a set of entries associating respective entry indexes withcorresponding pixel values, wherein the encoding includes determiningprediction information predicting the palette associated with eachprocessed pixel block from a palette predictor; obtaining informationabout a number of color components; determining a palette predictorinitializer to initialize the palette predictor for the slice, thestructure of the palette predictor initializer being based on saidinformation about the number of color components; and in the bitstream,providing the encoded data including the prediction information andproviding said information about the number of components and thepalette predictor initializer, wherein the palette predictor initializeris associated with a coding structure hierarchically above the slice inthe bitstream, and wherein, in the palette coding mode, each palettepredictor subsequent to the initialized palette predictor is built froma current palette associated with a block currently being encoded andthe palette predictor for predicting the current palette.
 3. The methodof claim 1, wherein the palette predictor initializer is defined at theimage level in a Picture Parameter Set, PPS; and the slice makesreference to the Picture Parameter Set.
 4. The method of claim 1,wherein the palette predictor initializer is defined at a sequence levelin a Sequence Parameter Set, SPS; and the slice makes reference to theSequence Parameter Set.
 5. The method of claim 4, wherein the palettepredictor initializer is defined after a first field indicating whetherthe palette coding mode is activated or not and after a second fieldcomprising a maximum size for the palette predictor, in the SequenceParameter Set.
 6. The method of claim 1, wherein the palette predictorinitializer is defined at a tile level in a tile comprising two slices;and each of the two slices identify the tile to which it belongs.
 7. Themethod of claim 1, wherein the initializing for the slice is performedbefore decoding the very first block of pixels in the slice.
 8. Themethod of claim 1, wherein building each palette predictor subsequent tothe initialized palette predictor from a current palette and the palettepredictor for predicting the current palette comprises including all theentries of a current palette associated with a block currently beingencoded and entries of the palette predictor for predicting the currentpalette which are not used to predict the current palette in the palettepredictor to be built.
 9. The method of claim 1, wherein the predictioninformation to predict the palette from the palette predictor includes abitmap of flags, each flag of which defining whether or not acorresponding entry in the palette predictor is selected as an entry togenerate an entry in the palette.
 10. The method of claim 2, whereindetermining the predictor initializer comprises encoding, using thepalette coding mode, a subset of blocks of pixels spread over an imagearea defined by said coding structure hierarchically above the slice,and comprises using a palette predictor obtained at the end of theencoding, as the palette predictor initializer.
 11. The method of claim10, wherein the blocks of pixels of the subset are distributed along aslope or a diagonal of the area.
 12. The method of claim 10, wherein theblocks of pixels of the subset are horizontally aligned on the top ofthe image.
 13. The method of claim 12, wherein the blocks of pixels ofthe subset are not contiguous.
 14. The method of claim 10, whereindetermining a palette predictor initializer comprises recursivelyencoding the same subset of block of pixels, wherein the first palettepredictor used for the next recursive encoding loop is the palettepredictor obtained at the end of the previous recursive encoding loop.15. The method of claim 1, wherein two or more images are split intohierarchical coding structures including a plurality of slices, saidslices each having a same hierarchical level in the image, and theencoded data of the slices are related to at least two distinct images.16. The method of claim 1, wherein the image is split into hierarchicalcoding structures including a plurality of slices, said slices eachhaving a same hierarchical level in the image, and the slices areincluded in the same image.
 17. The method of claim 1, wherein a size ofthe palette is set using a size of the palette predictor initializerused to initialize the palette predictor.
 18. (canceled)
 19. The methodof claim 1, wherein said information is a flag for signalling whethersaid image is a monochrome image or not.
 20. A decoding device fordecoding at least one image from a bitstream, the image being split intohierarchical coding structures including at least one slice, thedecoding device comprising: a decoder configured to decode encoded dataof the slice, using a palette coding mode, the palette coding modeusing, for each of processed pixel blocks of the slice, an associatedpalette that comprises a set of entries associating respective entryindexes with corresponding pixel values, wherein the palette associatedwith each processed pixel block is predicted from a palette predictorusing prediction information from the bitstream; an obtaining unitconfigured to obtain, from the bitstream, information about a number ofcolor components and a palette predictor initializer associated with acoding structure hierarchically above the slice, the structure of thepalette predictor initializer being based on said information about thenumber of color components; and an initializer configured to initializethe palette predictor for the slice using the obtained palette predictorinitializer, wherein, in the palette coding mode, each palette predictorsubsequent to the initialized palette predictor is built from a currentpalette associated with a block currently being decoded and the palettepredictor for predicting the current palette.
 21. An encoding device forencoding at least one image into a bitstream, the encoding devicecomprising: an obtaining unit configured to obtain hierarchical codingstructures by splitting the image; and an encoder configured to: encodedata of the coding structures of the image to obtain a slice, whereinsaid encoding uses a palette coding mode, the palette coding mode using,for each block of pixels of the slice, an associated palette thatcomprises a set of entries associating respective entry indexes withcorresponding pixel values, wherein said encoding includes determiningprediction information predicting the palette associated with eachprocessed pixel block from a palette predictor; obtain information abouta number of color components; determine a palette predictor initializerto initialize the palette predictor for the slice, the structure of thepalette predictor initializer being based on said information about thenumber of color components; and in the bitstream, provide the encodeddata including the prediction information and provide said informationabout the number of color components and the palette predictorinitializer, wherein the palette predictor initializer is associatedwith a coding structure hierarchically above the slice in the bitstream,and wherein, in the palette coding mode, each palette predictorsubsequent to the initialized palette predictor is built from a currentpalette associated with a block currently being encoded and the palettepredictor for predicting the current palette.
 22. A non-transitorycomputer-readable medium storing a program which, when executed, causesa computer to execute a process of decoding at least one image from abitstream, the image being split into hierarchical coding structuresincluding at least one slice, the process comprising: decoding encodeddata of the slice, using a palette coding mode, the palette coding modeusing, for each of processed pixel blocks of the slice, an associatedpalette that comprises a set of entries associating respective entryindexes with corresponding pixel values, wherein the palette associatedwith each processed pixel block is predicted from a palette predictorusing prediction information from the bitstream; obtaining, from thebitstream, information about a number of color components and a palettepredictor initializer associated with a coding structure hierarchicallyabove the slice, the structure of the palette predictor initializerbeing based on said information about the number of color components;and initializing the palette predictor for the slice using the obtainedpalette predictor initializer wherein each palette predictor subsequentto the initialized palette is built from a current palette associatedwith a block currently being decoded and the palette predictor using forpredicting the current palette.
 23. A non-transitory computer-readablemedium storing a program which, when executed, causes a computer toexecute a process of encoding at least one image into a bitstream, theprocess comprising: obtaining hierarchical coding structures bysplitting the image; encoding data of the coding structures of the imageto obtain an encoded slice, wherein said encoding uses a palette codingmode, the palette coding mode using, for each of block of pixels of theslice, an associated palette that comprises a set of entries associatingrespective entry indexes with corresponding pixel values, wherein theencoding includes determining prediction information predicting thepalette associated with each processed pixel block from a palettepredictor; obtaining information about a number of color components;determining a palette predictor initializer to initialize the palettepredictor for the slice, the structure of the palette predictorinitializer being based on said information about the number of colorcomponents; and in the bitstream, providing the encoded data includingthe prediction information and providing said information about thenumber of components and the palette predictor initializer, wherein thepalette predictor initializer is associated with a coding structurehierarchically above the slice in the bitstream, and wherein, in thepalette coding mode, each palette predictor subsequent to theinitialized palette predictor is built from a current palette predictorassociated with a block currently being encoded and the palettepredictor for predicting the current palette.